Base | Representation |
---|---|
bin | 100001001001001… |
… | …0101110111100101 |
3 | 2212111121202110122 |
4 | 1002102111313211 |
5 | 4234144320141 |
6 | 302204131325 |
7 | 36362505641 |
oct | 10222256745 |
9 | 2774552418 |
10 | 1112104421 |
11 | 52083256a |
12 | 270536b45 |
13 | 14952b36c |
14 | a79adc21 |
15 | 6797764b |
hex | 42495de5 |
1112104421 has 2 divisors, whose sum is σ = 1112104422. Its totient is φ = 1112104420.
The previous prime is 1112104397. The next prime is 1112104423. The reversal of 1112104421 is 1244012111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1094881921 + 17222500 = 33089^2 + 4150^2 .
It is a cyclic number.
It is not a de Polignac number, because 1112104421 - 214 = 1112088037 is a prime.
Together with 1112104423, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1112104421.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1112104423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556052210 + 556052211.
It is an arithmetic number, because the mean of its divisors is an integer number (556052211).
Almost surely, 21112104421 is an apocalyptic number.
It is an amenable number.
1112104421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112104421 is an equidigital number, since it uses as much as digits as its factorization.
1112104421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
The square root of 1112104421 is about 33348.2296531615. The cubic root of 1112104421 is about 1036.0527212006.
Adding to 1112104421 its reverse (1244012111), we get a palindrome (2356116532).
The spelling of 1112104421 in words is "one billion, one hundred twelve million, one hundred four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •