Base | Representation |
---|---|
bin | 10111001111010110011110… |
… | …110111001100011101100001 |
3 | 111101220011212202222220211010 |
4 | 113033112132313030131201 |
5 | 101344102041003341001 |
6 | 1001214343211411133 |
7 | 30346300063246212 |
oct | 2717263667143541 |
9 | 441804782886733 |
10 | 102210002012001 |
11 | 2a627022587884 |
12 | b568b96a53aa9 |
13 | 4505491c3c680 |
14 | 1b34dc1cab409 |
15 | bc3ab3d7a8d6 |
hex | 5cf59edcc761 |
102210002012001 has 8 divisors (see below), whose sum is σ = 146763079812160. Its totient is φ = 62898462776592.
The previous prime is 102210002011967. The next prime is 102210002012059. The reversal of 102210002012001 is 100210200012201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102210002012001 - 221 = 102209999914849 is a prime.
It is a super-2 number, since 2×1022100020120012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102210002017001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1310384641141 + ... + 1310384641218.
It is an arithmetic number, because the mean of its divisors is an integer number (18345384976520).
Almost surely, 2102210002012001 is an apocalyptic number.
It is an amenable number.
102210002012001 is a deficient number, since it is larger than the sum of its proper divisors (44553077800159).
102210002012001 is a wasteful number, since it uses less digits than its factorization.
102210002012001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2620769282375.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 102210002012001 its reverse (100210200012201), we get a palindrome (202420202024202).
The spelling of 102210002012001 in words is "one hundred two trillion, two hundred ten billion, two million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •