Base | Representation |
---|---|
bin | 1001000111001111110100… |
… | …1101111110010110110001 |
3 | 1022110220122211120101201221 |
4 | 2101303331031332112301 |
5 | 2303132142140030301 |
6 | 33151101555425041 |
7 | 2052633500661514 |
oct | 221637515762661 |
9 | 38426584511657 |
10 | 10020112033201 |
11 | 3213562023266 |
12 | 1159b6b2b5181 |
13 | 578b7aacaa9a |
14 | 268d94258d7b |
15 | 1259a593dda1 |
hex | 91cfd37e5b1 |
10020112033201 has 2 divisors, whose sum is σ = 10020112033202. Its totient is φ = 10020112033200.
The previous prime is 10020112033199. The next prime is 10020112033219. The reversal of 10020112033201 is 10233021102001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5185935880225 + 4834176152976 = 2277265^2 + 2198676^2 .
It is an emirp because it is prime and its reverse (10233021102001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10020112033201 - 21 = 10020112033199 is a prime.
Together with 10020112033199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10020112013201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010056016600 + 5010056016601.
It is an arithmetic number, because the mean of its divisors is an integer number (5010056016601).
Almost surely, 210020112033201 is an apocalyptic number.
It is an amenable number.
10020112033201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10020112033201 is an equidigital number, since it uses as much as digits as its factorization.
10020112033201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 10020112033201 its reverse (10233021102001), we get a palindrome (20253133135202).
The spelling of 10020112033201 in words is "ten trillion, twenty billion, one hundred twelve million, thirty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •