Base | Representation |
---|---|
bin | 10011010001011010… |
… | …100001101000000000 |
3 | 1222102011000120021200 |
4 | 103101122201220000 |
5 | 314334433321200 |
6 | 13301212221200 |
7 | 1331540546262 |
oct | 232132415000 |
9 | 58364016250 |
10 | 20693260800 |
11 | 8859896133 |
12 | 401616a800 |
13 | 1c4a1c7724 |
14 | 10043c7b32 |
15 | 811a5b800 |
hex | 4d16a1a00 |
20693260800 has 360 divisors, whose sum is σ = 74445886944. Its totient is φ = 5489172480.
The previous prime is 20693260787. The next prime is 20693260823. The reversal of 20693260800 is 806239602.
It is a tau number, because it is divible by the number of its divisors (360).
It is a super-2 number, since 2×206932608002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 30297259 + ... + 30297941.
Almost surely, 220693260800 is an apocalyptic number.
20693260800 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20693260800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37222943472).
20693260800 is an abundant number, since it is smaller than the sum of its proper divisors (53752626144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20693260800 is a wasteful number, since it uses less digits than its factorization.
20693260800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 980 (or 956 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 36.
The spelling of 20693260800 in words is "twenty billion, six hundred ninety-three million, two hundred sixty thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •