Base | Representation |
---|---|
bin | 1011000110001000111011… |
… | …0000000101110010011001 |
3 | 1121012022121002110121002102 |
4 | 2301202032300011302121 |
5 | 3044341302113420204 |
6 | 41540352144213145 |
7 | 2366266621513433 |
oct | 261421660056231 |
9 | 47168532417072 |
10 | 12200102091929 |
11 | 39840416361a4 |
12 | 145056560a1b5 |
13 | 6a6606c0578b |
14 | 3026b9477653 |
15 | 16254530e41e |
hex | b188ec05c99 |
12200102091929 has 2 divisors, whose sum is σ = 12200102091930. Its totient is φ = 12200102091928.
The previous prime is 12200102091899. The next prime is 12200102091949. The reversal of 12200102091929 is 92919020100221.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12103079186704 + 97022905225 = 3478948^2 + 311485^2 .
It is a cyclic number.
It is not a de Polignac number, because 12200102091929 - 240 = 11100590464153 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12200102091892 and 12200102091901.
It is not a weakly prime, because it can be changed into another prime (12200102091949) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6100051045964 + 6100051045965.
It is an arithmetic number, because the mean of its divisors is an integer number (6100051045965).
Almost surely, 212200102091929 is an apocalyptic number.
It is an amenable number.
12200102091929 is a deficient number, since it is larger than the sum of its proper divisors (1).
12200102091929 is an equidigital number, since it uses as much as digits as its factorization.
12200102091929 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 38.
The spelling of 12200102091929 in words is "twelve trillion, two hundred billion, one hundred two million, ninety-one thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •