Base | Representation |
---|---|
bin | 1011000111011010111010… |
… | …0001100110101101010001 |
3 | 1121021102101212020021010212 |
4 | 2301312232201212231101 |
5 | 3100221340130031001 |
6 | 41554432042133505 |
7 | 2401006164615524 |
oct | 261665641465521 |
9 | 47242355207125 |
10 | 12222110002001 |
11 | 3992405514829 |
12 | 1454887ab1295 |
13 | 6a8703596c83 |
14 | 3037a62b6bbb |
15 | 162dd24a17bb |
hex | b1dae866b51 |
12222110002001 has 2 divisors, whose sum is σ = 12222110002002. Its totient is φ = 12222110002000.
The previous prime is 12222110001799. The next prime is 12222110002021. The reversal of 12222110002001 is 10020001122221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7058580926401 + 5163529075600 = 2656799^2 + 2272340^2 .
It is a cyclic number.
It is not a de Polignac number, because 12222110002001 - 234 = 12204930132817 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (12222110002021) 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, 6111055001000 + 6111055001001.
It is an arithmetic number, because the mean of its divisors is an integer number (6111055001001).
Almost surely, 212222110002001 is an apocalyptic number.
It is an amenable number.
12222110002001 is a deficient number, since it is larger than the sum of its proper divisors (1).
12222110002001 is an equidigital number, since it uses as much as digits as its factorization.
12222110002001 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 14.
Adding to 12222110002001 its reverse (10020001122221), we get a palindrome (22242111124222).
The spelling of 12222110002001 in words is "twelve trillion, two hundred twenty-two billion, one hundred ten million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •