Base | Representation |
---|---|
bin | 100001001000111… |
… | …1101010110111101 |
3 | 2212111102122202102 |
4 | 1002101331112331 |
5 | 4234133112104 |
6 | 302202034445 |
7 | 36361610153 |
oct | 10221752675 |
9 | 2774378672 |
10 | 1112004029 |
11 | 5207740a4 |
12 | 2704a8a25 |
13 | 1494c4766 |
14 | a79853d3 |
15 | 67957a1e |
hex | 4247d5bd |
1112004029 has 2 divisors, whose sum is σ = 1112004030. Its totient is φ = 1112004028.
The previous prime is 1112004001. The next prime is 1112004053. The reversal of 1112004029 is 9204002111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 702144004 + 409860025 = 26498^2 + 20245^2 .
It is an emirp because it is prime and its reverse (9204002111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1112004029 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1112004029.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1112001029) 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, 556002014 + 556002015.
It is an arithmetic number, because the mean of its divisors is an integer number (556002015).
Almost surely, 21112004029 is an apocalyptic number.
It is an amenable number.
1112004029 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112004029 is an equidigital number, since it uses as much as digits as its factorization.
1112004029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
The square root of 1112004029 is about 33346.7244118519. The cubic root of 1112004029 is about 1036.0215447113.
The spelling of 1112004029 in words is "one billion, one hundred twelve million, four thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •