Base | Representation |
---|---|
bin | 110101001000111010… |
… | …0100011110001000000 |
3 | 101220112220200100010121 |
4 | 1222101310203301000 |
5 | 3332202044432000 |
6 | 124231325510024 |
7 | 11146614541150 |
oct | 1522164436100 |
9 | 356486610117 |
10 | 114115624000 |
11 | 4443a327364 |
12 | 1a149112314 |
13 | a9b8072791 |
14 | 5747a34760 |
15 | 2e7d5abb1a |
hex | 1a91d23c40 |
114115624000 has 448 divisors, whose sum is σ = 333039403008. Its totient is φ = 37924608000.
The previous prime is 114115623989. The next prime is 114115624001. The reversal of 114115624000 is 426511411.
It is a tau number, because it is divible by the number of its divisors (448).
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (114115624001) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 502711887 + ... + 502712113.
Almost surely, 2114115624000 is an apocalyptic number.
114115624000 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 114115624000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166519701504).
114115624000 is an abundant number, since it is smaller than the sum of its proper divisors (218923779008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114115624000 is a wasteful number, since it uses less digits than its factorization.
114115624000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 499 (or 479 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 25.
The spelling of 114115624000 in words is "one hundred fourteen billion, one hundred fifteen million, six hundred twenty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •