Base | Representation |
---|---|
bin | 1011000110001000111100… |
… | …1110101011110111010101 |
3 | 1121012022121122120001211222 |
4 | 2301202033032223313111 |
5 | 3044341311142042323 |
6 | 41540353032140125 |
7 | 2366300046626252 |
oct | 261421716536725 |
9 | 47168548501758 |
10 | 12200110112213 |
11 | 3984046113a31 |
12 | 1450568237645 |
13 | 6a66087831ca |
14 | 3026ba564429 |
15 | 162545d959c8 |
hex | b188f3abdd5 |
12200110112213 has 2 divisors, whose sum is σ = 12200110112214. Its totient is φ = 12200110112212.
The previous prime is 12200110112191. The next prime is 12200110112237. The reversal of 12200110112213 is 31221101100221.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10785325946404 + 1414784165809 = 3284102^2 + 1189447^2 .
It is a cyclic number.
It is not a de Polignac number, because 12200110112213 - 226 = 12200043003349 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12200110112191 and 12200110112200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12200110112513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6100055056106 + 6100055056107.
It is an arithmetic number, because the mean of its divisors is an integer number (6100055056107).
Almost surely, 212200110112213 is an apocalyptic number.
It is an amenable number.
12200110112213 is a deficient number, since it is larger than the sum of its proper divisors (1).
12200110112213 is an equidigital number, since it uses as much as digits as its factorization.
12200110112213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 12200110112213 its reverse (31221101100221), we get a palindrome (43421211212434).
The spelling of 12200110112213 in words is "twelve trillion, two hundred billion, one hundred ten million, one hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •