Base | Representation |
---|---|
bin | 1001001000100001011100… |
… | …0110000101101100011001 |
3 | 1022120000012201011202010112 |
4 | 2102020113012011230121 |
5 | 2304012024334311301 |
6 | 33205124001054105 |
7 | 2054340433134155 |
oct | 222102706055431 |
9 | 38500181152115 |
10 | 10042021010201 |
11 | 3221885079a24 |
12 | 1162264627335 |
13 | 57ac5cb302bb |
14 | 26a071ca4065 |
15 | 12633908c9bb |
hex | 92217185b19 |
10042021010201 has 2 divisors, whose sum is σ = 10042021010202. Its totient is φ = 10042021010200.
The previous prime is 10042021010183. The next prime is 10042021010207. The reversal of 10042021010201 is 10201012024001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8442046470400 + 1599974539801 = 2905520^2 + 1264901^2 .
It is an emirp because it is prime and its reverse (10201012024001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10042021010201 - 234 = 10024841141017 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 (10042021010207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5021010505100 + 5021010505101.
It is an arithmetic number, because the mean of its divisors is an integer number (5021010505101).
Almost surely, 210042021010201 is an apocalyptic number.
It is an amenable number.
10042021010201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10042021010201 is an equidigital number, since it uses as much as digits as its factorization.
10042021010201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10042021010201 its reverse (10201012024001), we get a palindrome (20243033034202).
The spelling of 10042021010201 in words is "ten trillion, forty-two billion, twenty-one million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •