Base | Representation |
---|---|
bin | 110101000111000111… |
… | …1110101010111110000 |
3 | 101220101201212010000221 |
4 | 1222032033311113300 |
5 | 3332041222241021 |
6 | 124221344422424 |
7 | 11145256105030 |
oct | 1521617652760 |
9 | 356351763027 |
10 | 114055665136 |
11 | 444094a4386 |
12 | 1a131017a14 |
13 | a9a880b46a |
14 | 573daa78c0 |
15 | 2e781b6241 |
hex | 1a8e3f55f0 |
114055665136 has 160 divisors (see below), whose sum is σ = 268200691200. Its totient is φ = 45899965440.
The previous prime is 114055665071. The next prime is 114055665197. The reversal of 114055665136 is 631566550411.
It is a junction number, because it is equal to n+sod(n) for n = 114055665092 and 114055665101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 174663786 + ... + 174664438.
It is an arithmetic number, because the mean of its divisors is an integer number (1676254320).
Almost surely, 2114055665136 is an apocalyptic number.
114055665136 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 114055665136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (134100345600).
114055665136 is an abundant number, since it is smaller than the sum of its proper divisors (154145026064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114055665136 is a wasteful number, since it uses less digits than its factorization.
114055665136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1287 (or 1281 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 43.
The spelling of 114055665136 in words is "one hundred fourteen billion, fifty-five million, six hundred sixty-five thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •