Base | Representation |
---|---|
bin | 100001101011010… |
… | …1010000101010111 |
3 | 2220202022121102220 |
4 | 1003112222011113 |
5 | 4303240404030 |
6 | 304044033423 |
7 | 40000644405 |
oct | 10326520527 |
9 | 2822277386 |
10 | 1130013015 |
11 | 52a95455a |
12 | 276532873 |
13 | 15015b871 |
14 | aa112475 |
15 | 69313a10 |
hex | 435aa157 |
1130013015 has 16 divisors (see below), whose sum is σ = 1818851328. Its totient is φ = 599063456.
The previous prime is 1130012993. The next prime is 1130013019. The reversal of 1130013015 is 5103100311.
It is a cyclic number.
It is not a de Polignac number, because 1130013015 - 27 = 1130012887 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 1130012985 and 1130013003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130013019) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 223047 + ... + 228056.
It is an arithmetic number, because the mean of its divisors is an integer number (113678208).
Almost surely, 21130013015 is an apocalyptic number.
1130013015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1130013015 is a deficient number, since it is larger than the sum of its proper divisors (688838313).
1130013015 is a wasteful number, since it uses less digits than its factorization.
1130013015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 451278.
The product of its (nonzero) digits is 45, while the sum is 15.
The square root of 1130013015 is about 33615.6662138355. Note that the first 3 decimals coincide. The cubic root of 1130013015 is about 1041.5844361612.
Adding to 1130013015 its reverse (5103100311), we get a palindrome (6233113326).
The spelling of 1130013015 in words is "one billion, one hundred thirty million, thirteen thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •