Base | Representation |
---|---|
bin | 1011000110001101000011… |
… | …1010000110001001101101 |
3 | 1121012102110102222022222111 |
4 | 2301203100322012021231 |
5 | 3044401040233323432 |
6 | 41541054233444021 |
7 | 2366336256621433 |
oct | 261432072061155 |
9 | 47172412868874 |
10 | 12201212011117 |
11 | 3984561105988 |
12 | 1450815270611 |
13 | 6a6752b4a2ac |
14 | 302782a38d53 |
15 | 1625ac9a4347 |
hex | b18d0e8626d |
12201212011117 has 2 divisors, whose sum is σ = 12201212011118. Its totient is φ = 12201212011116.
The previous prime is 12201212011063. The next prime is 12201212011129. The reversal of 12201212011117 is 71111021210221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9767256318121 + 2433955692996 = 3125261^2 + 1560114^2 .
It is a cyclic number.
It is not a de Polignac number, because 12201212011117 - 227 = 12201077793389 is a prime.
It is a super-3 number, since 3×122012120111173 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12201212011187) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6100606005558 + 6100606005559.
It is an arithmetic number, because the mean of its divisors is an integer number (6100606005559).
Almost surely, 212201212011117 is an apocalyptic number.
It is an amenable number.
12201212011117 is a deficient number, since it is larger than the sum of its proper divisors (1).
12201212011117 is an equidigital number, since it uses as much as digits as its factorization.
12201212011117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 112, while the sum is 22.
Adding to 12201212011117 its reverse (71111021210221), we get a palindrome (83312233221338).
The spelling of 12201212011117 in words is "twelve trillion, two hundred one billion, two hundred twelve million, eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •