Base | Representation |
---|---|
bin | 1011000110010000110010… |
… | …0001001011001011111101 |
3 | 1121012112001010211200020122 |
4 | 2301210030201023023331 |
5 | 3044410112300023401 |
6 | 41541341401224325 |
7 | 2366403122420015 |
oct | 261441441131375 |
9 | 47175033750218 |
10 | 12202212111101 |
11 | 3984a246978a1 |
12 | 1450a541920a5 |
13 | 6a68820c0b2c |
14 | 3028397b0c45 |
15 | 16261a6a521b |
hex | b190c84b2fd |
12202212111101 has 2 divisors, whose sum is σ = 12202212111102. Its totient is φ = 12202212111100.
The previous prime is 12202212111077. The next prime is 12202212111127. The reversal of 12202212111101 is 10111121220221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11100024988900 + 1102187122201 = 3331670^2 + 1049851^2 .
It is a cyclic number.
It is not a de Polignac number, because 12202212111101 - 214 = 12202212094717 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12202212111101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12202212111191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6101106055550 + 6101106055551.
It is an arithmetic number, because the mean of its divisors is an integer number (6101106055551).
Almost surely, 212202212111101 is an apocalyptic number.
It is an amenable number.
12202212111101 is a deficient number, since it is larger than the sum of its proper divisors (1).
12202212111101 is an equidigital number, since it uses as much as digits as its factorization.
12202212111101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 12202212111101 its reverse (10111121220221), we get a palindrome (22313333331322).
The spelling of 12202212111101 in words is "twelve trillion, two hundred two billion, two hundred twelve million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •