Base | Representation |
---|---|
bin | 11010000111111110101110… |
… | …101000100110000110000000 |
3 | 120001211002210022000120121000 |
4 | 122013332232220212012000 |
5 | 110024440241100401142 |
6 | 1044211121225132000 |
7 | 33126035431661631 |
oct | 3207765650460600 |
9 | 501732708016530 |
10 | 114897600012672 |
11 | 33678886918654 |
12 | 10a77b1192a000 |
13 | 4c15a49573039 |
14 | 2053105a0b888 |
15 | d43b3c17714c |
hex | 687faea26180 |
114897600012672 has 128 divisors (see below), whose sum is σ = 339734321647200. Its totient is φ = 38228406036480.
The previous prime is 114897600012631. The next prime is 114897600012733. The reversal of 114897600012672 is 276210006798411.
114897600012672 is a `hidden beast` number, since 1 + 1 + 4 + 8 + 9 + 7 + 600 + 0 + 1 + 26 + 7 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28856583 + ... + 32595974.
Almost surely, 2114897600012672 is an apocalyptic number.
114897600012672 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
114897600012672 is an abundant number, since it is smaller than the sum of its proper divisors (224836721634528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114897600012672 is an equidigital number, since it uses as much as digits as its factorization.
114897600012672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61453121 (or 61453103 counting only the distinct ones).
The product of its (nonzero) digits is 2032128, while the sum is 54.
The spelling of 114897600012672 in words is "one hundred fourteen trillion, eight hundred ninety-seven billion, six hundred million, twelve thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •