Base | Representation |
---|---|
bin | 11010011000001110100001… |
… | …110110001010110011101000 |
3 | 120012202211121111101012110000 |
4 | 122120032201312022303220 |
5 | 110201233312200322242 |
6 | 1050424044201023000 |
7 | 33302511656326440 |
oct | 3230164166126350 |
9 | 505684544335400 |
10 | 116014076964072 |
11 | 33a69325a69051 |
12 | 1101837b784a60 |
13 | 4c97107b796a1 |
14 | 209117b51d120 |
15 | d62bd4432a4c |
hex | 6983a1d8ace8 |
116014076964072 has 80 divisors (see below), whose sum is σ = 371367812518560. Its totient is φ = 33146879131296.
The previous prime is 116014076964017. The next prime is 116014076964083. The reversal of 116014076964072 is 270469670410611.
It is a happy number.
116014076964072 is a `hidden beast` number, since 1 + 1 + 6 + 0 + 140 + 7 + 6 + 96 + 407 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 12788143278 + ... + 12788152349.
It is an arithmetic number, because the mean of its divisors is an integer number (4642097656482).
Almost surely, 2116014076964072 is an apocalyptic number.
116014076964072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
116014076964072 is an abundant number, since it is smaller than the sum of its proper divisors (255353735554488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116014076964072 is a wasteful number, since it uses less digits than its factorization.
116014076964072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25576295652 (or 25576295639 counting only the distinct ones).
The product of its (nonzero) digits is 3048192, while the sum is 54.
The spelling of 116014076964072 in words is "one hundred sixteen trillion, fourteen billion, seventy-six million, nine hundred sixty-four thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •