Base | Representation |
---|---|
bin | 110101010110011010… |
… | …1101101111100000000 |
3 | 101221201111121210020202 |
4 | 1222230311231330000 |
5 | 3334114120201030 |
6 | 124344321224332 |
7 | 11164060455320 |
oct | 1525465557400 |
9 | 357644553222 |
10 | 114568912640 |
11 | 44652189876 |
12 | 1a254a920a8 |
13 | aa5ac51300 |
14 | 578bd0b280 |
15 | 2ea8299745 |
hex | 1aacd6df00 |
114568912640 has 432 divisors, whose sum is σ = 351459259200. Its totient is φ = 34995437568.
The previous prime is 114568912613. The next prime is 114568912697. The reversal of 114568912640 is 46219865411.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 43911656 + ... + 43914264.
It is an arithmetic number, because the mean of its divisors is an integer number (813563100).
Almost surely, 2114568912640 is an apocalyptic number.
114568912640 is a gapful number since it is divisible by the number (10) 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 114568912640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (175729629600).
114568912640 is an abundant number, since it is smaller than the sum of its proper divisors (236890346560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114568912640 is a wasteful number, since it uses less digits than its factorization.
114568912640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2692 (or 2665 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 47.
The spelling of 114568912640 in words is "one hundred fourteen billion, five hundred sixty-eight million, nine hundred twelve thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •