Base | Representation |
---|---|
bin | 110101010100100100… |
… | …1100110100101011000 |
3 | 101221120012011010202110 |
4 | 1222221021212211120 |
5 | 3334002244012121 |
6 | 124334230432320 |
7 | 11162406403233 |
oct | 1525111464530 |
9 | 357505133673 |
10 | 114507016536 |
11 | 44620253370 |
12 | 1a2382026a0 |
13 | aa4b18c2b3 |
14 | 57839d841a |
15 | 2ea2b1ed76 |
hex | 1aa9266958 |
114507016536 has 32 divisors (see below), whose sum is σ = 312291864000. Its totient is φ = 34699095840.
The previous prime is 114507016523. The next prime is 114507016571. The reversal of 114507016536 is 635610705411.
It is a super-2 number, since 2×1145070165362 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114507016494 and 114507016503.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 216869086 + ... + 216869613.
It is an arithmetic number, because the mean of its divisors is an integer number (9759120750).
Almost surely, 2114507016536 is an apocalyptic number.
It is an amenable number.
114507016536 is an abundant number, since it is smaller than the sum of its proper divisors (197784847464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114507016536 is a wasteful number, since it uses less digits than its factorization.
114507016536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 433738719 (or 433738715 counting only the distinct ones).
The product of its (nonzero) digits is 75600, while the sum is 39.
The spelling of 114507016536 in words is "one hundred fourteen billion, five hundred seven million, sixteen thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •