Base | Representation |
---|---|
bin | 1001001100100110111010… |
… | …1111110001100110110101 |
3 | 1022210201101101002022121002 |
4 | 2103021232233301212311 |
5 | 2311134302011020001 |
6 | 33301252520533045 |
7 | 2062404005363534 |
oct | 223115657614665 |
9 | 38721341068532 |
10 | 10112211032501 |
11 | 3249623559616 |
12 | 1173993021185 |
13 | 58476774a586 |
14 | 26d60dc2231b |
15 | 1280961d646b |
hex | 9326ebf19b5 |
10112211032501 has 2 divisors, whose sum is σ = 10112211032502. Its totient is φ = 10112211032500.
The previous prime is 10112211032423. The next prime is 10112211032527. The reversal of 10112211032501 is 10523011221101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10050003190276 + 62207842225 = 3170174^2 + 249415^2 .
It is an emirp because it is prime and its reverse (10523011221101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10112211032501 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10112211032591) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5056105516250 + 5056105516251.
It is an arithmetic number, because the mean of its divisors is an integer number (5056105516251).
Almost surely, 210112211032501 is an apocalyptic number.
It is an amenable number.
10112211032501 is a deficient number, since it is larger than the sum of its proper divisors (1).
10112211032501 is an equidigital number, since it uses as much as digits as its factorization.
10112211032501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 20.
Adding to 10112211032501 its reverse (10523011221101), we get a palindrome (20635222253602).
The spelling of 10112211032501 in words is "ten trillion, one hundred twelve billion, two hundred eleven million, thirty-two thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •