Base | Representation |
---|---|
bin | 10010101110000100… |
… | …100100000111110100 |
3 | 1220212211021002202201 |
4 | 102232010210013310 |
5 | 312131134120200 |
6 | 13122311114244 |
7 | 1311050512342 |
oct | 225604440764 |
9 | 56784232681 |
10 | 20100301300 |
11 | 8585106962 |
12 | 3a8b672984 |
13 | 1b843c5611 |
14 | d89754992 |
15 | 7c997ec6a |
hex | 4ae1241f4 |
20100301300 has 18 divisors (see below), whose sum is σ = 43617654038. Its totient is φ = 8040120480.
The previous prime is 20100301279. The next prime is 20100301301. The reversal of 20100301300 is 310300102.
It can be written as a sum of positive squares in 3 ways, for example, as 960132196 + 19140169104 = 30986^2 + 138348^2 .
It is a super-2 number, since 2×201003013002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20100301301) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 100501407 + ... + 100501606.
Almost surely, 220100301300 is an apocalyptic number.
20100301300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20100301300 is an abundant number, since it is smaller than the sum of its proper divisors (23517352738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20100301300 is a wasteful number, since it uses less digits than its factorization.
20100301300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201003027 (or 201003020 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 10.
Adding to 20100301300 its reverse (310300102), we get a palindrome (20410601402).
The spelling of 20100301300 in words is "twenty billion, one hundred million, three hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •