Base | Representation |
---|---|
bin | 100001010010101… |
… | …0000001110111000 |
3 | 2212211221122002100 |
4 | 1002211100032320 |
5 | 4241431441242 |
6 | 302502303400 |
7 | 36452604510 |
oct | 10245201670 |
9 | 2784848070 |
10 | 1117062072 |
11 | 5236092a5 |
12 | 272127b60 |
13 | 14a575a99 |
14 | a8500840 |
15 | 6810654c |
hex | 429503b8 |
1117062072 has 96 divisors (see below), whose sum is σ = 3462451200. Its totient is φ = 318710592.
The previous prime is 1117062047. The next prime is 1117062101. The reversal of 1117062072 is 2702607111.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 546829 + ... + 548867.
It is an arithmetic number, because the mean of its divisors is an integer number (36067200).
Almost surely, 21117062072 is an apocalyptic number.
1117062072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1117062072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1731225600).
1117062072 is an abundant number, since it is smaller than the sum of its proper divisors (2345389128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1117062072 is a wasteful number, since it uses less digits than its factorization.
1117062072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3145 (or 3138 counting only the distinct ones).
The product of its (nonzero) digits is 1176, while the sum is 27.
The square root of 1117062072 is about 33422.4785436389. The cubic root of 1117062072 is about 1037.5899791706.
Adding to 1117062072 its reverse (2702607111), we get a palindrome (3819669183).
The spelling of 1117062072 in words is "one billion, one hundred seventeen million, sixty-two thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •