Base | Representation |
---|---|
bin | 10110010110101010… |
… | …00001110101110001 |
3 | 1010222101102020121202 |
4 | 23023111001311301 |
5 | 144034303101001 |
6 | 5302511500545 |
7 | 603254463266 |
oct | 131325016561 |
9 | 33871366552 |
10 | 12001222001 |
11 | 50a941679a |
12 | 23ab227755 |
13 | 11934a1ac2 |
14 | 81bc5926d |
15 | 4a391296b |
hex | 2cb541d71 |
12001222001 has 2 divisors, whose sum is σ = 12001222002. Its totient is φ = 12001222000.
The previous prime is 12001221949. The next prime is 12001222019. The reversal of 12001222001 is 10022210021.
It is a happy number.
12001222001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9015692401 + 2985529600 = 94951^2 + 54640^2 .
It is a cyclic number.
It is not a de Polignac number, because 12001222001 - 26 = 12001221937 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 (12001222091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6000611000 + 6000611001.
It is an arithmetic number, because the mean of its divisors is an integer number (6000611001).
Almost surely, 212001222001 is an apocalyptic number.
It is an amenable number.
12001222001 is a deficient number, since it is larger than the sum of its proper divisors (1).
12001222001 is an equidigital number, since it uses as much as digits as its factorization.
12001222001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 12001222001 its reverse (10022210021), we get a palindrome (22023432022).
The spelling of 12001222001 in words is "twelve billion, one million, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •