Base | Representation |
---|---|
bin | 11111010111100110… |
… | …01011111110110001 |
3 | 1121110200020201100220 |
4 | 33223303023332301 |
5 | 233442241403230 |
6 | 11423040203253 |
7 | 1134222564300 |
oct | 175363137661 |
9 | 47420221326 |
10 | 16840966065 |
11 | 7162317080 |
12 | 3320009529 |
13 | 17850805a1 |
14 | b5a922437 |
15 | 688760d10 |
hex | 3ebccbfb1 |
16840966065 has 192 divisors, whose sum is σ = 36979338240. Its totient is φ = 6449103360.
The previous prime is 16840966063. The next prime is 16840966117. The reversal of 16840966065 is 56066904861.
It is a happy number.
It is not a de Polignac number, because 16840966065 - 21 = 16840966063 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 16840965999 and 16840966017.
It is not an unprimeable number, because it can be changed into a prime (16840966063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 5682274 + ... + 5685236.
It is an arithmetic number, because the mean of its divisors is an integer number (192600720).
Almost surely, 216840966065 is an apocalyptic number.
16840966065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
16840966065 is an abundant number, since it is smaller than the sum of its proper divisors (20138372175).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16840966065 is a wasteful number, since it uses less digits than its factorization.
16840966065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3052 (or 3045 counting only the distinct ones).
The product of its (nonzero) digits is 1866240, while the sum is 51.
The spelling of 16840966065 in words is "sixteen billion, eight hundred forty million, nine hundred sixty-six thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •