Base | Representation |
---|---|
bin | 10111001100010011110101… |
… | …011111011101011000001001 |
3 | 111101011012102012121202201202 |
4 | 113030103311133131120021 |
5 | 101332141023003310441 |
6 | 1000534340300153545 |
7 | 30325220626452524 |
oct | 2714236537353011 |
9 | 441135365552652 |
10 | 102001002010121 |
11 | 2a556422523aa5 |
12 | b5345892388b5 |
13 | 44bb86516c3c6 |
14 | 1b28c367b3bbb |
15 | bbd43072919b |
hex | 5cc4f57dd609 |
102001002010121 has 8 divisors (see below), whose sum is σ = 102779266632480. Its totient is φ = 101224597041792.
The previous prime is 102001002010051. The next prime is 102001002010153. The reversal of 102001002010121 is 121010200100201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102001002010121 - 218 = 102001001747977 is a prime.
It is a super-2 number, since 2×1020010020101212 (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 (102001302010121) 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, 464803391 + ... + 465022788.
It is an arithmetic number, because the mean of its divisors is an integer number (12847408329060).
Almost surely, 2102001002010121 is an apocalyptic number.
It is an amenable number.
102001002010121 is a deficient number, since it is larger than the sum of its proper divisors (778264622359).
102001002010121 is an equidigital number, since it uses as much as digits as its factorization.
102001002010121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 929827015.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102001002010121 its reverse (121010200100201), we get a palindrome (223011202110322).
The spelling of 102001002010121 in words is "one hundred two trillion, one billion, two million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •