Base | Representation |
---|---|
bin | 110110010101011001… |
… | …0110001010111011001 |
3 | 102011011202220021110100 |
4 | 1230222302301113121 |
5 | 3402431102210330 |
6 | 125334125410013 |
7 | 11300330140353 |
oct | 1545262612731 |
9 | 364152807410 |
10 | 116682069465 |
11 | 45536a93875 |
12 | 1a744709909 |
13 | b006997870 |
14 | 590c8200d3 |
15 | 307da60060 |
hex | 1b2acb15d9 |
116682069465 has 288 divisors, whose sum is σ = 248262932736. Its totient is φ = 50254110720.
The previous prime is 116682069463. The next prime is 116682069529. The reversal of 116682069465 is 564960286611.
116682069465 is a `hidden beast` number, since 116 + 6 + 8 + 2 + 0 + 69 + 465 = 666.
It is not a de Polignac number, because 116682069465 - 21 = 116682069463 is a prime.
It is a super-2 number, since 2×1166820694652 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (116682069463) by changing a digit.
It is a polite number, since it can be written in 287 ways as a sum of consecutive naturals, for example, 143873910 + ... + 143874720.
It is an arithmetic number, because the mean of its divisors is an integer number (862024072).
Almost surely, 2116682069465 is an apocalyptic number.
116682069465 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
116682069465 is an abundant number, since it is smaller than the sum of its proper divisors (131580863271).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116682069465 is a wasteful number, since it uses less digits than its factorization.
116682069465 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 929 (or 909 counting only the distinct ones).
The product of its (nonzero) digits is 3732480, while the sum is 54.
The spelling of 116682069465 in words is "one hundred sixteen billion, six hundred eighty-two million, sixty-nine thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •