Base | Representation |
---|---|
bin | 10011001101010011… |
… | …100110011000010000 |
3 | 1222020100022211210010 |
4 | 103031103212120100 |
5 | 314214312231100 |
6 | 13250311034520 |
7 | 1330042652433 |
oct | 231523463020 |
9 | 58210284703 |
10 | 20624336400 |
11 | 882399a218 |
12 | 3bb706ba40 |
13 | 1c38b44665 |
14 | dd91a581a |
15 | 80a994750 |
hex | 4cd4e6610 |
20624336400 has 120 divisors (see below), whose sum is σ = 66488038144. Its totient is φ = 5464742400.
The previous prime is 20624336387. The next prime is 20624336407. The reversal of 20624336400 is 463342602.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (20624336407) 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, 133665 + ... + 243135.
Almost surely, 220624336400 is an apocalyptic number.
20624336400 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 20624336400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33244019072).
20624336400 is an abundant number, since it is smaller than the sum of its proper divisors (45863701744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20624336400 is a wasteful number, since it uses less digits than its factorization.
20624336400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109649 (or 109638 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 30.
The spelling of 20624336400 in words is "twenty billion, six hundred twenty-four million, three hundred thirty-six thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •