Search a number
-
+
489010101110 = 251631201249797
BaseRepresentation
bin1110001110110110100…
…01011111101101110110
31201202012221210000010022
413013123101133231312
531002443041213420
61012351555325142
750221061163656
oct7073321375566
91652187700108
10489010101110
1117942a4a9833
127a9345b07b2
133716234c01b
141994d822366
15cac0ddbc25
hex71db45fb76

489010101110 has 32 divisors (see below), whose sum is σ = 886359242592. Its totient is φ = 194241369600.

The previous prime is 489010101109. The next prime is 489010101131. The reversal of 489010101110 is 11101010984.

It is a super-2 number, since 2×4890101011102 (a number of 24 digits) contains 22 as substring.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 489010101110.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1832732 + ... + 2082528.

It is an arithmetic number, because the mean of its divisors is an integer number (27698726331).

Almost surely, 2489010101110 is an apocalyptic number.

489010101110 is a deficient number, since it is larger than the sum of its proper divisors (397349141482).

489010101110 is a wasteful number, since it uses less digits than its factorization.

489010101110 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 251168.

The product of its (nonzero) digits is 288, while the sum is 26.

The spelling of 489010101110 in words is "four hundred eighty-nine billion, ten million, one hundred one thousand, one hundred ten".

Divisors: 1 2 5 10 163 326 815 1201 1630 2402 6005 12010 195763 249797 391526 499594 978815 1248985 1957630 2497970 40716911 81433822 203584555 300006197 407169110 600012394 1500030985 3000061970 48901010111 97802020222 244505050555 489010101110