Base | Representation |
---|---|
bin | 1101111000011… |
… | …11011010011000 |
3 | 22010010112022112 |
4 | 12330033122120 |
5 | 214303030224 |
6 | 15320011452 |
7 | 2612565065 |
oct | 674173230 |
9 | 263115275 |
10 | 116455064 |
11 | 5a810460 |
12 | 33000b88 |
13 | 1b18552b |
14 | 11675c6c |
15 | a35530e |
hex | 6f0f698 |
116455064 has 32 divisors (see below), whose sum is σ = 239749200. Its totient is φ = 52590720.
The previous prime is 116455061. The next prime is 116455067. The reversal of 116455064 is 460554611.
It is an interprime number because it is at equal distance from previous prime (116455061) and next prime (116455067).
It is a self number, because there is not a number n which added to its sum of digits gives 116455064.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116455061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9602 + ... + 18030.
Almost surely, 2116455064 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 116455064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119874600).
116455064 is an abundant number, since it is smaller than the sum of its proper divisors (123294136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116455064 is a wasteful number, since it uses less digits than its factorization.
116455064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8603 (or 8599 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 32.
The square root of 116455064 is about 10791.4347516908. The cubic root of 116455064 is about 488.3368072635.
The spelling of 116455064 in words is "one hundred sixteen million, four hundred fifty-five thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •