Base | Representation |
---|---|
bin | 110100010000011010… |
… | …1110010101101001001 |
3 | 101201122210221212010012 |
4 | 1220200311302231021 |
5 | 3314311322400204 |
6 | 123315254401305 |
7 | 11051630204066 |
oct | 1504065625511 |
9 | 351583855105 |
10 | 112220121929 |
11 | 43657373623 |
12 | 198ba360235 |
13 | a775455316 |
14 | 5607dbbc6d |
15 | 2dbbe8b76e |
hex | 1a20d72b49 |
112220121929 has 2 divisors, whose sum is σ = 112220121930. Its totient is φ = 112220121928.
The previous prime is 112220121907. The next prime is 112220122013. The reversal of 112220121929 is 929121022211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83074803529 + 29145318400 = 288227^2 + 170720^2 .
It is an emirp because it is prime and its reverse (929121022211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112220121929 - 232 = 107925154633 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112220121895 and 112220121904.
It is not a weakly prime, because it can be changed into another prime (112220121029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56110060964 + 56110060965.
It is an arithmetic number, because the mean of its divisors is an integer number (56110060965).
Almost surely, 2112220121929 is an apocalyptic number.
It is an amenable number.
112220121929 is a deficient number, since it is larger than the sum of its proper divisors (1).
112220121929 is an equidigital number, since it uses as much as digits as its factorization.
112220121929 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 32.
The spelling of 112220121929 in words is "one hundred twelve billion, two hundred twenty million, one hundred twenty-one thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •