Base | Representation |
---|---|
bin | 1001001100000000111101… |
… | …0100110111110101010001 |
3 | 1022202202002011020220012201 |
4 | 2103000033110313311101 |
5 | 2311002414133210001 |
6 | 33252445400123201 |
7 | 2061563323000006 |
oct | 223001724676521 |
9 | 38682064226181 |
10 | 10102020210001 |
11 | 324527405a865 |
12 | 1171a0a166501 |
13 | 58380236a1a5 |
14 | 26cd245c98ad |
15 | 127b9b6d3501 |
hex | 9300f537d51 |
10102020210001 has 2 divisors, whose sum is σ = 10102020210002. Its totient is φ = 10102020210000.
The previous prime is 10102020209999. The next prime is 10102020210017. The reversal of 10102020210001 is 10001202020101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8391681985600 + 1710338224401 = 2896840^2 + 1307799^2 .
It is a cyclic number.
It is not a de Polignac number, because 10102020210001 - 21 = 10102020209999 is a prime.
Together with 10102020209999, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 10102020210001.
It is not a weakly prime, because it can be changed into another prime (10102020210091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051010105000 + 5051010105001.
It is an arithmetic number, because the mean of its divisors is an integer number (5051010105001).
Almost surely, 210102020210001 is an apocalyptic number.
It is an amenable number.
10102020210001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10102020210001 is an equidigital number, since it uses as much as digits as its factorization.
10102020210001 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 10.
Adding to 10102020210001 its reverse (10001202020101), we get a palindrome (20103222230102).
The spelling of 10102020210001 in words is "ten trillion, one hundred two billion, twenty million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •