Base | Representation |
---|---|
bin | 1001001100100110111101… |
… | …0110100110101001000001 |
3 | 1022210201102002020110010222 |
4 | 2103021233112212221001 |
5 | 2311134312112224301 |
6 | 33301253523032425 |
7 | 2062404161036204 |
oct | 223115726465101 |
9 | 38721362213128 |
10 | 10112221211201 |
11 | 3249629280a6a |
12 | 117399650b715 |
13 | 5847698a2585 |
14 | 26d61131193b |
15 | 12809704731b |
hex | 9326f5a6a41 |
10112221211201 has 2 divisors, whose sum is σ = 10112221211202. Its totient is φ = 10112221211200.
The previous prime is 10112221211179. The next prime is 10112221211311. The reversal of 10112221211201 is 10211212221101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8438240668225 + 1673980542976 = 2904865^2 + 1293824^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10112221211201 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10112221211201.
It is not a weakly prime, because it can be changed into another prime (10112221211401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5056110605600 + 5056110605601.
It is an arithmetic number, because the mean of its divisors is an integer number (5056110605601).
Almost surely, 210112221211201 is an apocalyptic number.
It is an amenable number.
10112221211201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10112221211201 is an equidigital number, since it uses as much as digits as its factorization.
10112221211201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 10112221211201 its reverse (10211212221101), we get a palindrome (20323433432302).
The spelling of 10112221211201 in words is "ten trillion, one hundred twelve billion, two hundred twenty-one million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •