Base | Representation |
---|---|
bin | 1111001011001110110111… |
… | …0010111100111110011000 |
3 | 2012002010120010011101211110 |
4 | 3302303231302330332120 |
5 | 4141334143442103213 |
6 | 55253140043100320 |
7 | 3341332530265062 |
oct | 362635562747630 |
9 | 65063503141743 |
10 | 16685642534808 |
11 | 5353383242a55 |
12 | 1a55957b116a0 |
13 | 9405ac278300 |
14 | 419837498732 |
15 | 1de07278e5c3 |
hex | f2cedcbcf98 |
16685642534808 has 96 divisors (see below), whose sum is σ = 45177476155200. Its totient is φ = 5133161464704.
The previous prime is 16685642534807. The next prime is 16685642534837. The reversal of 16685642534808 is 80843524658661.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16685642534807) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23445963 + ... + 24147141.
It is an arithmetic number, because the mean of its divisors is an integer number (470598709950).
Almost surely, 216685642534808 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 16685642534808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22588738077600).
16685642534808 is an abundant number, since it is smaller than the sum of its proper divisors (28491833620392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16685642534808 is a wasteful number, since it uses less digits than its factorization.
16685642534808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 707081 (or 707064 counting only the distinct ones).
The product of its (nonzero) digits is 265420800, while the sum is 66.
The spelling of 16685642534808 in words is "sixteen trillion, six hundred eighty-five billion, six hundred forty-two million, five hundred thirty-four thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •