Base | Representation |
---|---|
bin | 10010111010110010… |
… | …001111000100101100 |
3 | 1221102200121210222200 |
4 | 102322302033010230 |
5 | 313100240202200 |
6 | 13155410541500 |
7 | 1316250516330 |
oct | 227262170454 |
9 | 57380553880 |
10 | 20313600300 |
11 | 8684552624 |
12 | 3b2ab97890 |
13 | 1bb9657c46 |
14 | da9bd97c0 |
15 | 7dd564800 |
hex | 4bac8f12c |
20313600300 has 216 divisors, whose sum is σ = 73587477600. Its totient is φ = 4590812160.
The previous prime is 20313600289. The next prime is 20313600313. The reversal of 20313600300 is 300631302.
It is a happy number.
20313600300 is a `hidden beast` number, since 2 + 0 + 3 + 1 + 360 + 0 + 300 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 542586 + ... + 578814.
Almost surely, 220313600300 is an apocalyptic number.
20313600300 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 20313600300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36793738800).
20313600300 is an abundant number, since it is smaller than the sum of its proper divisors (53273877300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20313600300 is a wasteful number, since it uses less digits than its factorization.
20313600300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36345 (or 36335 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
The spelling of 20313600300 in words is "twenty billion, three hundred thirteen million, six hundred thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •