Base | Representation |
---|---|
bin | 1010111010100011111111… |
… | …0111110100001001010001 |
3 | 1120111022012222022201002112 |
4 | 2232220333313310021101 |
5 | 3033111434304034022 |
6 | 41305140241155105 |
7 | 2346026114511014 |
oct | 256507767641121 |
9 | 46438188281075 |
10 | 12001210221137 |
11 | 3907759331965 |
12 | 1419ab902ba95 |
13 | 69092b352477 |
14 | 2d6c0c60d37b |
15 | 15c2a42c98e2 |
hex | aea3fdf4251 |
12001210221137 has 2 divisors, whose sum is σ = 12001210221138. Its totient is φ = 12001210221136.
The previous prime is 12001210221067. The next prime is 12001210221139. The reversal of 12001210221137 is 73112201210021.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9684942340096 + 2316267881041 = 3112064^2 + 1521929^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12001210221137 is a prime.
Together with 12001210221139, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (12001210221139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6000605110568 + 6000605110569.
It is an arithmetic number, because the mean of its divisors is an integer number (6000605110569).
Almost surely, 212001210221137 is an apocalyptic number.
It is an amenable number.
12001210221137 is a deficient number, since it is larger than the sum of its proper divisors (1).
12001210221137 is an equidigital number, since it uses as much as digits as its factorization.
12001210221137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 23.
Adding to 12001210221137 its reverse (73112201210021), we get a palindrome (85113411431158).
The spelling of 12001210221137 in words is "twelve trillion, one billion, two hundred ten million, two hundred twenty-one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •