Base | Representation |
---|---|
bin | 1011000110001100101011… |
… | …1001001100000001000001 |
3 | 1121012102012102010000020212 |
4 | 2301203022321030001001 |
5 | 3044400333421002242 |
6 | 41541040231043505 |
7 | 2366333623153256 |
oct | 261431271140101 |
9 | 47172172100225 |
10 | 12201111109697 |
11 | 398450a159184 |
12 | 14507a7510595 |
13 | 6a6737c7c403 |
14 | 30277349142d |
15 | 1625a3bc2782 |
hex | b18cae4c041 |
12201111109697 has 2 divisors, whose sum is σ = 12201111109698. Its totient is φ = 12201111109696.
The previous prime is 12201111109673. The next prime is 12201111109709. The reversal of 12201111109697 is 79690111110221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6852478940176 + 5348632169521 = 2617724^2 + 2312711^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12201111109697 is a prime.
It is a super-2 number, since 2×122011111096972 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12201111100697) 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, 6100555554848 + 6100555554849.
It is an arithmetic number, because the mean of its divisors is an integer number (6100555554849).
Almost surely, 212201111109697 is an apocalyptic number.
It is an amenable number.
12201111109697 is a deficient number, since it is larger than the sum of its proper divisors (1).
12201111109697 is an equidigital number, since it uses as much as digits as its factorization.
12201111109697 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 41.
The spelling of 12201111109697 in words is "twelve trillion, two hundred one billion, one hundred eleven million, one hundred nine thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •