Base | Representation |
---|---|
bin | 100001010010100… |
… | …0010110100101110 |
3 | 2212211211211202012 |
4 | 1002211002310232 |
5 | 4241423212100 |
6 | 302501201222 |
7 | 36452255420 |
oct | 10245026456 |
9 | 2784754665 |
10 | 1117007150 |
11 | 523581006 |
12 | 272100212 |
13 | 14a556a9c |
14 | a84c8810 |
15 | 680e5135 |
hex | 42942d2e |
1117007150 has 48 divisors (see below), whose sum is σ = 2499423360. Its totient is φ = 362815200.
The previous prime is 1117007137. The next prime is 1117007153. The reversal of 1117007150 is 517007111.
It is a super-2 number, since 2×11170071502 = 2495409946302245000, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1117007153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 77336 + ... + 90635.
It is an arithmetic number, because the mean of its divisors is an integer number (52071320).
Almost surely, 21117007150 is an apocalyptic number.
1117007150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1117007150 is an abundant number, since it is smaller than the sum of its proper divisors (1382416210).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1117007150 is a wasteful number, since it uses less digits than its factorization.
1117007150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168009 (or 168004 counting only the distinct ones).
The product of its (nonzero) digits is 245, while the sum is 23.
The square root of 1117007150 is about 33421.6569008779. The cubic root of 1117007150 is about 1037.5729740126.
The spelling of 1117007150 in words is "one billion, one hundred seventeen million, seven thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •