1027089 (number)

1,027,089 (one million twenty-seven thousand eighty-nine) is an odd seven-digits composite number following 1027088 and preceding 1027090. In scientific notation, it is written as 1.027089 × 106. The sum of its digits is 27. It has a total of 6 prime factors and 36 positive divisors. There are 548,352 positive integers (up to 1027089) that are relatively prime to 1027089.

Basic properties

• Is Prime? No
• Number parity Odd
• Number length 7
• Sum of Digits 27
• Digital Root 9

Name

Short name 1 million 27 thousand 89 one million twenty-seven thousand eighty-nine

Notation

Scientific notation 1.027089 × 106 1.027089 × 106

Prime Factorization of 1027089

Prime Factorization 32 × 72 × 17 × 137

Composite number
Distinct Factors Total Factors Radical ω(n) 4 Total number of distinct prime factors Ω(n) 6 Total number of prime factors rad(n) 48909 Product of the distinct prime numbers λ(n) 1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) 0 Returns: 1, if n has an even number of prime factors (and is square free) −1, if n has an odd number of prime factors (and is square free) 0, if n has a squared prime factor Λ(n) 0 Returns log(p) if n is a power pk of any prime p (for any k >= 1), else returns 0

The prime factorization of 1,027,089 is 32 × 72 × 17 × 137. Since it has a total of 6 prime factors, 1,027,089 is a composite number.

Divisors of 1027089

36 divisors

 Even divisors 0 36 20 16
Total Divisors Sum of Divisors Aliquot Sum τ(n) 36 Total number of the positive divisors of n σ(n) 1.84064e+06 Sum of all the positive divisors of n s(n) 813555 Sum of the proper positive divisors of n A(n) 51129 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 1013.45 Returns the nth root of the product of n divisors H(n) 20.0882 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 1,027,089 can be divided by 36 positive divisors (out of which 0 are even, and 36 are odd). The sum of these divisors (counting 1,027,089) is 1,840,644, the average is 51,129.

Other Arithmetic Functions (n = 1027089)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 548352 Total number of positive integers not greater than n that are coprime to n λ(n) 5712 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 80299 Total number of primes less than or equal to n r2(n) 16 The number of ways n can be represented as the sum of 2 squares

There are 548,352 positive integers (less than 1,027,089) that are coprime with 1,027,089. And there are approximately 80,299 prime numbers less than or equal to 1,027,089.

Divisibility of 1027089

 m n mod m 2 3 4 5 6 7 8 9 1 0 1 4 3 0 1 0

The number 1,027,089 is divisible by 3, 7 and 9.

• Arithmetic
• Deficient

• Polite

Base conversion (1027089)

Base System Value
2 Binary 11111010110000010001
3 Ternary 1221011220100
4 Quaternary 3322300101
5 Quinary 230331324
6 Senary 34003013
8 Octal 3726021
10 Decimal 1027089
12 Duodecimal 416469
20 Vigesimal 687e9
36 Base36 m0i9

Basic calculations (n = 1027089)

Multiplication

n×y
 n×2 2054178 3081267 4108356 5135445

Division

n÷y
 n÷2 513544 342363 256772 205418

Exponentiation

ny
 n2 1054911813921 1083488320048305969 1112838935150094529394241 1142984629064375440101001594449

Nth Root

y√n
 2√n 1013.45 100.895 31.8348 15.9339

1027089 as geometric shapes

Circle

 Diameter 2.05418e+06 6.45339e+06 3.3141e+12

Sphere

 Volume 4.53851e+18 1.32564e+13 6.45339e+06

Square

Length = n
 Perimeter 4.10836e+06 1.05491e+12 1.45252e+06

Cube

Length = n
 Surface area 6.32947e+12 1.08349e+18 1.77897e+06

Equilateral Triangle

Length = n
 Perimeter 3.08127e+06 4.5679e+11 889485

Triangular Pyramid

Length = n
 Surface area 1.82716e+12 1.2769e+17 838615

Cryptographic Hash Functions

md5 7267faf88200f58704027cc0c10cf56f d8db0118024ab993f228cc4c02e3ad7abc941d5e df6512e80c57a2ab65194323f916e520f4c69a1cfb5bb71d525834e11fef8842 2dd05ab3e2097fcae38abd2a102c2bbdc16031429bfd4b7e1b668a6c672c8aec73e90544b4649a213e7ae65121759a58546115fc616601d17ebeba89c41d7494 67a6e275853e6805d2714e3c29bba1da53fb77ee
{"ft_lang_label":"__label__en","ft_lang_prob":0.6180929,"math_prob":0.98913455,"size":4674,"snap":"2022-05-2022-21","text_gpt3_token_len":1671,"char_repetition_ratio":0.122698076,"word_repetition_ratio":0.031111112,"special_character_ratio":0.47261447,"punctuation_ratio":0.08635794,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99737364,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-01-29T08:21:37Z\",\"WARC-Record-ID\":\"<urn:uuid:c470858b-6d5b-4592-94d5-cc5cb06d8d88>\",\"Content-Length\":\"40192\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e15820c0-86a7-4a3a-9425-27f7368ecc64>\",\"WARC-Concurrent-To\":\"<urn:uuid:f0a5c7d1-9206-49aa-8ea1-88d8797631e8>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/1027089\",\"WARC-Payload-Digest\":\"sha1:L6PMB73SOTZ4EW4TS22WV2QMMAJTPR42\",\"WARC-Block-Digest\":\"sha1:ND4FNZGKZAOJENE6BMFTB5Q52HYJEGZR\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-05/CC-MAIN-2022-05_segments_1642320300573.3_warc_CC-MAIN-20220129062503-20220129092503-00470.warc.gz\"}"}