Base | Representation |
---|---|
bin | 1011000110001100101011… |
… | …1000110001011110111101 |
3 | 1121012102012101220111011211 |
4 | 2301203022320301132331 |
5 | 3044400333404013041 |
6 | 41541040224444421 |
7 | 2366333622221365 |
oct | 261431270613675 |
9 | 47172171814154 |
10 | 12201111001021 |
11 | 398450a094568 |
12 | 14507a7479711 |
13 | 6a6737c41ac7 |
14 | 3027734639a5 |
15 | 1625a3ba0481 |
hex | b18cae317bd |
12201111001021 has 2 divisors, whose sum is σ = 12201111001022. Its totient is φ = 12201111001020.
The previous prime is 12201111001003. The next prime is 12201111001033. The reversal of 12201111001021 is 12010011110221.
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., 6110141296900 + 6090969704121 = 2471870^2 + 2467989^2 .
It is a cyclic number.
It is not a de Polignac number, because 12201111001021 - 25 = 12201111000989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12201111000992 and 12201111001010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12201111001061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6100555500510 + 6100555500511.
It is an arithmetic number, because the mean of its divisors is an integer number (6100555500511).
Almost surely, 212201111001021 is an apocalyptic number.
It is an amenable number.
12201111001021 is a deficient number, since it is larger than the sum of its proper divisors (1).
12201111001021 is an equidigital number, since it uses as much as digits as its factorization.
12201111001021 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 13.
Adding to 12201111001021 its reverse (12010011110221), we get a palindrome (24211122111242).
The spelling of 12201111001021 in words is "twelve trillion, two hundred one billion, one hundred eleven million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •