Base | Representation |
---|---|
bin | 100001101011010… |
… | …1100110010110001 |
3 | 2220202100011122221 |
4 | 1003112230302301 |
5 | 4303241232423 |
6 | 304044201041 |
7 | 40001021641 |
oct | 10326546261 |
9 | 2822304587 |
10 | 1130024113 |
11 | 52a961929 |
12 | 276539181 |
13 | 15016392a |
14 | aa116521 |
15 | 69316e5d |
hex | 435accb1 |
1130024113 has 2 divisors, whose sum is σ = 1130024114. Its totient is φ = 1130024112.
The previous prime is 1130024081. The next prime is 1130024131. The reversal of 1130024113 is 3114200311.
Together with next prime (1130024131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1085241249 + 44782864 = 32943^2 + 6692^2 .
It is a cyclic number.
It is not a de Polignac number, because 1130024113 - 25 = 1130024081 is a prime.
It is a super-2 number, since 2×11300241132 = 2553908991922873538, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1130028113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 565012056 + 565012057.
It is an arithmetic number, because the mean of its divisors is an integer number (565012057).
Almost surely, 21130024113 is an apocalyptic number.
It is an amenable number.
1130024113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1130024113 is an equidigital number, since it uses as much as digits as its factorization.
1130024113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1130024113 is about 33615.8312852739. The cubic root of 1130024113 is about 1041.5878459940.
Adding to 1130024113 its reverse (3114200311), we get a palindrome (4244224424).
The spelling of 1130024113 in words is "one billion, one hundred thirty million, twenty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •