Base | Representation |
---|---|
bin | 10111001100010100000001… |
… | …111101011111100100010010 |
3 | 111101011012221210021020000111 |
4 | 113030110001331133210102 |
5 | 101332141440032210002 |
6 | 1000534413132111534 |
7 | 30325226046564646 |
oct | 2714240175374422 |
9 | 441135853236014 |
10 | 102001211210002 |
11 | 2a55651a61aa65 |
12 | b5346273055aa |
13 | 44bb8995c8010 |
14 | 1b28c564acc26 |
15 | bbd443c9e3d7 |
hex | 5cc501f5f912 |
102001211210002 has 16 divisors (see below), whose sum is σ = 165510071596800. Its totient is φ = 46866372309072.
The previous prime is 102001211209993. The next prime is 102001211210011. The reversal of 102001211210002 is 200012112100201.
It is an interprime number because it is at equal distance from previous prime (102001211209993) and next prime (102001211210011).
It is a Harshad number since it is a multiple of its sum of digits (13).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8796235252 + ... + 8796246847.
It is an arithmetic number, because the mean of its divisors is an integer number (10344379474800).
Almost surely, 2102001211210002 is an apocalyptic number.
102001211210002 is a deficient number, since it is larger than the sum of its proper divisors (63508860386798).
102001211210002 is a wasteful number, since it uses less digits than its factorization.
102001211210002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17592482337.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102001211210002 its reverse (200012112100201), we get a palindrome (302013323310203).
The spelling of 102001211210002 in words is "one hundred two trillion, one billion, two hundred eleven million, two hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •