Base | Representation |
---|---|
bin | 11010000001011110011011… |
… | …110101101110110100100000 |
3 | 120000020101000122212012212120 |
4 | 122001132123311232310200 |
5 | 110000124321132343100 |
6 | 1043225514501024240 |
7 | 33051532522223031 |
oct | 3201363365566440 |
9 | 500211018765776 |
10 | 114450608090400 |
11 | 3351625960055a |
12 | 10a053650b5080 |
13 | 4bb285244713a |
14 | 2039620824a88 |
15 | d371ca0260a0 |
hex | 68179bd6ed20 |
114450608090400 has 576 divisors, whose sum is σ = 400901660651520. Its totient is φ = 28256289177600.
The previous prime is 114450608090393. The next prime is 114450608090411. The reversal of 114450608090400 is 4090806054411.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1965429285 + ... + 1965487515.
It is an arithmetic number, because the mean of its divisors is an integer number (696009827520).
Almost surely, 2114450608090400 is an apocalyptic number.
114450608090400 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 114450608090400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (200450830325760).
114450608090400 is an abundant number, since it is smaller than the sum of its proper divisors (286451052561120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114450608090400 is a wasteful number, since it uses less digits than its factorization.
114450608090400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59057 (or 59044 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 42.
The spelling of 114450608090400 in words is "one hundred fourteen trillion, four hundred fifty billion, six hundred eight million, ninety thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •