Base | Representation |
---|---|
bin | 100001001101100… |
… | …1111010110010100 |
3 | 2212200000021011220 |
4 | 1002123033112110 |
5 | 4240243441022 |
6 | 302330130340 |
7 | 36421362333 |
oct | 10233172624 |
9 | 2780007156 |
10 | 1114437012 |
11 | 522086027 |
12 | 2712809b0 |
13 | 149b66cb0 |
14 | a8019d1a |
15 | 67c8885c |
hex | 426cf594 |
1114437012 has 48 divisors (see below), whose sum is σ = 2813735232. Its totient is φ = 341268480.
The previous prime is 1114436957. The next prime is 1114437013. The reversal of 1114437012 is 2107344111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1114437013) 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, 15988 + ... + 49844.
It is an arithmetic number, because the mean of its divisors is an integer number (58619484).
Almost surely, 21114437012 is an apocalyptic number.
1114437012 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 1114437012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1406867616).
1114437012 is an abundant number, since it is smaller than the sum of its proper divisors (1699298220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1114437012 is a wasteful number, since it uses less digits than its factorization.
1114437012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34088 (or 34086 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 24.
The square root of 1114437012 is about 33383.1845694805. The cubic root of 1114437012 is about 1036.7765739675.
The spelling of 1114437012 in words is "one billion, one hundred fourteen million, four hundred thirty-seven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •