Base | Representation |
---|---|
bin | 10010101000001001… |
… | …110000101101101100 |
3 | 1220121220102002101220 |
4 | 102220021300231230 |
5 | 311430224002200 |
6 | 13104402503340 |
7 | 1305433461141 |
oct | 225011605554 |
9 | 56556362356 |
10 | 20001000300 |
11 | 8534052616 |
12 | 3a62364b50 |
13 | 1b69968028 |
14 | d7a4a63c8 |
15 | 7c0db74a0 |
hex | 4a8270b6c |
20001000300 has 72 divisors (see below), whose sum is σ = 57975830976. Its totient is φ = 5323805760.
The previous prime is 20001000251. The next prime is 20001000319. The reversal of 20001000300 is 300010002.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 103159 + ... + 225041.
Almost surely, 220001000300 is an apocalyptic number.
20001000300 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 20001000300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28987915488).
20001000300 is an abundant number, since it is smaller than the sum of its proper divisors (37974830676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20001000300 is a wasteful number, since it uses less digits than its factorization.
20001000300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122447 (or 122440 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 6.
Adding to 20001000300 its reverse (300010002), we get a palindrome (20301010302).
The spelling of 20001000300 in words is "twenty billion, one million, three hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •