Base | Representation |
---|---|
bin | 10111001101110000001000… |
… | …010100010101101111111001 |
3 | 111101111200012122221110100210 |
4 | 113031300020110111233321 |
5 | 101340302002120011301 |
6 | 1001052050035221333 |
7 | 30335326465430226 |
oct | 2715601024255771 |
9 | 441450178843323 |
10 | 102100102110201 |
11 | 2a594456995a58 |
12 | b54b825747849 |
13 | 44c7cc93bbb90 |
14 | 1b2d95810294d |
15 | bc0cd0956ad6 |
hex | 5cdc08515bf9 |
102100102110201 has 192 divisors, whose sum is σ = 155524397301504. Its totient is φ = 59171841792000.
The previous prime is 102100102110199. The next prime is 102100102110203. The reversal of 102100102110201 is 102011201001201.
It is an interprime number because it is at equal distance from previous prime (102100102110199) and next prime (102100102110203).
It is not a de Polignac number, because 102100102110201 - 21 = 102100102110199 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (102100102110203) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 427197079840 + ... + 427197080078.
It is an arithmetic number, because the mean of its divisors is an integer number (810022902612).
Almost surely, 2102100102110201 is an apocalyptic number.
It is an amenable number.
102100102110201 is a deficient number, since it is larger than the sum of its proper divisors (53424295191303).
102100102110201 is a wasteful number, since it uses less digits than its factorization.
102100102110201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 872 (or 633 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 102100102110201 its reverse (102011201001201), we get a palindrome (204111303111402).
The spelling of 102100102110201 in words is "one hundred two trillion, one hundred billion, one hundred two million, one hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •