Base | Representation |
---|---|
bin | 110111100110101011110111… |
… | …1100100001010001011100101 |
3 | 2101010202200210000201220011000 |
4 | 1233031113233210022023211 |
5 | 1003101421404030000401 |
6 | 4452122210030303513 |
7 | 205010311521401331 |
oct | 15715275744121345 |
9 | 2333680700656130 |
10 | 489102010000101 |
11 | 13192aaa7866873 |
12 | 46a332b5657b99 |
13 | 17cbb177318354 |
14 | 88ac940c847c1 |
15 | 3b829ebb69186 |
hex | 1bcd5ef90a2e5 |
489102010000101 has 16 divisors (see below), whose sum is σ = 740012497401600. Its totient is φ = 319130389502784.
The previous prime is 489102010000069. The next prime is 489102010000111. The reversal of 489102010000101 is 101000010201984.
It is not a de Polignac number, because 489102010000101 - 25 = 489102010000069 is a prime.
It is a super-2 number, since 2×4891020100001012 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (489102010000111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 192711586596 + ... + 192711589133.
It is an arithmetic number, because the mean of its divisors is an integer number (46250781087600).
Almost surely, 2489102010000101 is an apocalyptic number.
It is an amenable number.
489102010000101 is a deficient number, since it is larger than the sum of its proper divisors (250910487401499).
489102010000101 is a wasteful number, since it uses less digits than its factorization.
489102010000101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 385423175785 (or 385423175779 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 27.
The spelling of 489102010000101 in words is "four hundred eighty-nine trillion, one hundred two billion, ten million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •