Base | Representation |
---|---|
bin | 1011000110001100101101… |
… | …1011100001111001001001 |
3 | 1121012102020001001101100221 |
4 | 2301203023123201321021 |
5 | 3044400343222042301 |
6 | 41541041152030041 |
7 | 2366334062526526 |
oct | 261431333417111 |
9 | 47172201041327 |
10 | 12201120112201 |
11 | 3984514247969 |
12 | 14507aa532321 |
13 | 6a6739ab1c37 |
14 | 30277475614d |
15 | 1625a489eda1 |
hex | b18cb6e1e49 |
12201120112201 has 2 divisors, whose sum is σ = 12201120112202. Its totient is φ = 12201120112200.
The previous prime is 12201120112193. The next prime is 12201120112231. The reversal of 12201120112201 is 10221102110221.
12201120112201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12032157187600 + 168962924601 = 3468740^2 + 411051^2 .
It is a cyclic number.
It is not a de Polignac number, because 12201120112201 - 23 = 12201120112193 is a prime.
It is not a weakly prime, because it can be changed into another prime (12201120112231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6100560056100 + 6100560056101.
It is an arithmetic number, because the mean of its divisors is an integer number (6100560056101).
Almost surely, 212201120112201 is an apocalyptic number.
It is an amenable number.
12201120112201 is a deficient number, since it is larger than the sum of its proper divisors (1).
12201120112201 is an equidigital number, since it uses as much as digits as its factorization.
12201120112201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 12201120112201 its reverse (10221102110221), we get a palindrome (22422222222422).
The spelling of 12201120112201 in words is "twelve trillion, two hundred one billion, one hundred twenty million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •