Base | Representation |
---|---|
bin | 10011010000101010… |
… | …100001010000000000 |
3 | 1222101021100012200000 |
4 | 103100222201100000 |
5 | 314323223120402 |
6 | 13300042400000 |
7 | 1331325564030 |
oct | 232052412000 |
9 | 58337305600 |
10 | 20680676352 |
11 | 8852780266 |
12 | 4011b00000 |
13 | 1c4770c6cb |
14 | 100286d8c0 |
15 | 8108c2c1c |
hex | 4d0aa1400 |
20680676352 has 528 divisors, whose sum is σ = 73247096832. Its totient is φ = 5703229440.
The previous prime is 20680676333. The next prime is 20680676371. The reversal of 20680676352 is 25367608602.
It is a happy number.
20680676352 is a `hidden beast` number, since 2 + 0 + 6 + 8 + 0 + 6 + 7 + 635 + 2 = 666.
It is an interprime number because it is at equal distance from previous prime (20680676333) and next prime (20680676371).
It is a junction number, because it is equal to n+sod(n) for n = 20680676298 and 20680676307.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 53996353 + ... + 53996735.
Almost surely, 220680676352 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 20680676352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36623548416).
20680676352 is an abundant number, since it is smaller than the sum of its proper divisors (52566420480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20680676352 is an equidigital number, since it uses as much as digits as its factorization.
20680676352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 456 (or 426 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 45.
The spelling of 20680676352 in words is "twenty billion, six hundred eighty million, six hundred seventy-six thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •