Base | Representation |
---|---|
bin | 11010000010000010011000… |
… | …110110011101100110000000 |
3 | 120000101001200002011100020111 |
4 | 122002002120312131212000 |
5 | 110001242401414443000 |
6 | 1043255341310521104 |
7 | 33054400263505000 |
oct | 3202023066354600 |
9 | 500331602140214 |
10 | 114489212656000 |
11 | 335306698a9026 |
12 | 10a10939806194 |
13 | 4bb6395389070 |
14 | 203b44394c000 |
15 | d381d926acba |
hex | 682098d9d980 |
114489212656000 has 1024 divisors, whose sum is σ = 378519365952000. Its totient is φ = 34102178611200.
The previous prime is 114489212655913. The next prime is 114489212656037. The reversal of 114489212656000 is 656212984411.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1212800802 + ... + 1212895198.
Almost surely, 2114489212656000 is an apocalyptic number.
114489212656000 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 114489212656000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (189259682976000).
114489212656000 is an abundant number, since it is smaller than the sum of its proper divisors (264030153296000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114489212656000 is an equidigital number, since it uses as much as digits as its factorization.
114489212656000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94477 (or 94441 counting only the distinct ones).
The product of its (nonzero) digits is 829440, while the sum is 49.
The spelling of 114489212656000 in words is "one hundred fourteen trillion, four hundred eighty-nine billion, two hundred twelve million, six hundred fifty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •