Base | Representation |
---|---|
bin | 10010111010000010… |
… | …101000001100101100 |
3 | 1221101211010202122110 |
4 | 102322002220030230 |
5 | 313034041322200 |
6 | 13154243244020 |
7 | 1316036450436 |
oct | 227202501454 |
9 | 57354122573 |
10 | 20301120300 |
11 | 86784a917a |
12 | 3b26979610 |
13 | 1bb6ba8626 |
14 | da82ab656 |
15 | 7dc3ebb50 |
hex | 4ba0a832c |
20301120300 has 144 divisors (see below), whose sum is σ = 59570999712. Its totient is φ = 5337292800.
The previous prime is 20301120283. The next prime is 20301120331. The reversal of 20301120300 is 302110302.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
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, 8525110 + ... + 8527490.
It is an arithmetic number, because the mean of its divisors is an integer number (413687498).
Almost surely, 220301120300 is an apocalyptic number.
20301120300 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 20301120300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29785499856).
20301120300 is an abundant number, since it is smaller than the sum of its proper divisors (39269879412).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20301120300 is a wasteful number, since it uses less digits than its factorization.
20301120300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2788 (or 2781 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 20301120300 its reverse (302110302), we get a palindrome (20603230602).
The spelling of 20301120300 in words is "twenty billion, three hundred one million, one hundred twenty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •