Base | Representation |
---|---|
bin | 110101000111110000… |
… | …0000111100010010000 |
3 | 101220110012110100121110 |
4 | 1222033200013202100 |
5 | 3332112114223211 |
6 | 124223415453320 |
7 | 11145633021300 |
oct | 1521740074220 |
9 | 356405410543 |
10 | 114076711056 |
11 | 4441a369500 |
12 | 1a138087240 |
13 | a9acc99979 |
14 | 57427c5600 |
15 | 2e79e71ea6 |
hex | 1a8f807890 |
114076711056 has 1080 divisors, whose sum is σ = 427118391840. Its totient is φ = 26057687040.
The previous prime is 114076711033. The next prime is 114076711081. The reversal of 114076711056 is 650117670411.
It is a super-2 number, since 2×1140767110562 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 215 ways as a sum of consecutive naturals, for example, 1562694636 + ... + 1562694708.
Almost surely, 2114076711056 is an apocalyptic number.
114076711056 is a gapful number since it is divisible by the number (16) 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 114076711056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (213559195920).
114076711056 is an abundant number, since it is smaller than the sum of its proper divisors (313041680784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114076711056 is a wasteful number, since it uses less digits than its factorization.
114076711056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173 (or 132 counting only the distinct ones).
The product of its (nonzero) digits is 35280, while the sum is 39.
The spelling of 114076711056 in words is "one hundred fourteen billion, seventy-six million, seven hundred eleven thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •