Base | Representation |
---|---|
bin | 1011000111011011001111… |
… | …0101100100110001101001 |
3 | 1121021102122001221002020102 |
4 | 2301312303311210301221 |
5 | 3100222030433414144 |
6 | 41554444544235145 |
7 | 2401011326260616 |
oct | 261666365446151 |
9 | 47242561832212 |
10 | 12222199123049 |
11 | 3992450855793 |
12 | 14548b190bab5 |
13 | 6a8718b9bb16 |
14 | 3037b407550d |
15 | 162dda207b4e |
hex | b1db3d64c69 |
12222199123049 has 2 divisors, whose sum is σ = 12222199123050. Its totient is φ = 12222199123048.
The previous prime is 12222199123037. The next prime is 12222199123051. The reversal of 12222199123049 is 94032199122221.
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., 10966694560000 + 1255504563049 = 3311600^2 + 1120493^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12222199123049 is a prime.
Together with 12222199123051, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 12222199122994 and 12222199123012.
It is not a weakly prime, because it can be changed into another prime (12222199128049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6111099561524 + 6111099561525.
It is an arithmetic number, because the mean of its divisors is an integer number (6111099561525).
Almost surely, 212222199123049 is an apocalyptic number.
It is an amenable number.
12222199123049 is a deficient number, since it is larger than the sum of its proper divisors (1).
12222199123049 is an equidigital number, since it uses as much as digits as its factorization.
12222199123049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 279936, while the sum is 47.
The spelling of 12222199123049 in words is "twelve trillion, two hundred twenty-two billion, one hundred ninety-nine million, one hundred twenty-three thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •