Base | Representation |
---|---|
bin | 1001001100000000111101… |
… | …0100011101000000011001 |
3 | 1022202202002011001022111002 |
4 | 2103000033110131000121 |
5 | 2311002414121200441 |
6 | 33252445353514345 |
7 | 2061563322031445 |
oct | 223001724350031 |
9 | 38682064038432 |
10 | 10102020100121 |
11 | 3245273a95254 |
12 | 1171a0a1129b5 |
13 | 58380232c181 |
14 | 26cd2459b825 |
15 | 127b9b6b0b9b |
hex | 9300f51d019 |
10102020100121 has 2 divisors, whose sum is σ = 10102020100122. Its totient is φ = 10102020100120.
The previous prime is 10102020100019. The next prime is 10102020100163. The reversal of 10102020100121 is 12100102020101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7225671939721 + 2876348160400 = 2688061^2 + 1695980^2 .
It is a cyclic number.
It is not a de Polignac number, because 10102020100121 - 218 = 10102019837977 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10102020100621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051010050060 + 5051010050061.
It is an arithmetic number, because the mean of its divisors is an integer number (5051010050061).
Almost surely, 210102020100121 is an apocalyptic number.
It is an amenable number.
10102020100121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10102020100121 is an equidigital number, since it uses as much as digits as its factorization.
10102020100121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10102020100121 its reverse (12100102020101), we get a palindrome (22202122120222).
The spelling of 10102020100121 in words is "ten trillion, one hundred two billion, twenty million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •