Base | Representation |
---|---|
bin | 10001110010000100111… |
… | …011111010010110110101 |
3 | 11022211012100111020001102 |
4 | 101302010323322112311 |
5 | 130010124224310401 |
6 | 2333213550335445 |
7 | 154200216126434 |
oct | 21620473722665 |
9 | 4284170436042 |
10 | 1222001010101 |
11 | 43127a792673 |
12 | 1789b97ba585 |
13 | 8b307701691 |
14 | 4320648d11b |
15 | 21bc146856b |
hex | 11c84efa5b5 |
1222001010101 has 2 divisors, whose sum is σ = 1222001010102. Its totient is φ = 1222001010100.
The previous prime is 1222001010059. The next prime is 1222001010119. The reversal of 1222001010101 is 1010101002221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1078791745201 + 143209264900 = 1038649^2 + 378430^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1222001010101 is a prime.
It is a Sophie Germain prime.
1222001010101 is a modest number, since divided by 1010101 gives 12220 as remainder.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1222001040101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 611000505050 + 611000505051.
It is an arithmetic number, because the mean of its divisors is an integer number (611000505051).
Almost surely, 21222001010101 is an apocalyptic number.
It is an amenable number.
1222001010101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1222001010101 is an equidigital number, since it uses as much as digits as its factorization.
1222001010101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1222001010101 its reverse (1010101002221), we get a palindrome (2232102012322).
The spelling of 1222001010101 in words is "one trillion, two hundred twenty-two billion, one million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •