Base | Representation |
---|---|
bin | 1001001101001100001101… |
… | …1101011011011110010001 |
3 | 1022211200020001220101201202 |
4 | 2103103003131123132101 |
5 | 2311320302342034301 |
6 | 33310030143240545 |
7 | 2063210050155566 |
oct | 223230335333621 |
9 | 38750201811652 |
10 | 10122222221201 |
11 | 32528a0615892 |
12 | 11759078a9155 |
13 | 5856a185467c |
14 | 26dcbd65886d |
15 | 12848005466b |
hex | 934c375b791 |
10122222221201 has 2 divisors, whose sum is σ = 10122222221202. Its totient is φ = 10122222221200.
The previous prime is 10122222221179. The next prime is 10122222221213. The reversal of 10122222221201 is 10212222222101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7904279217025 + 2217943004176 = 2811455^2 + 1489276^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10122222221201 is a prime.
It is not a weakly prime, because it can be changed into another prime (10122222224201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5061111110600 + 5061111110601.
It is an arithmetic number, because the mean of its divisors is an integer number (5061111110601).
Almost surely, 210122222221201 is an apocalyptic number.
It is an amenable number.
10122222221201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10122222221201 is an equidigital number, since it uses as much as digits as its factorization.
10122222221201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 10122222221201 its reverse (10212222222101), we get a palindrome (20334444443302).
The spelling of 10122222221201 in words is "ten trillion, one hundred twenty-two billion, two hundred twenty-two million, two hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •