Base | Representation |
---|---|
bin | 1000101110110100000… |
… | …11001011100010100010 |
3 | 1001200101021122101220200 |
4 | 10113122003023202202 |
5 | 14403410304311320 |
6 | 345453445050030 |
7 | 30450360340152 |
oct | 4273203134242 |
9 | 1050337571820 |
10 | 300011010210 |
11 | 10626343744a |
12 | 4a1890b6916 |
13 | 223a21b5222 |
14 | 107407aa762 |
15 | 7c0d636290 |
hex | 45da0cb8a2 |
300011010210 has 24 divisors (see below), whose sum is σ = 780028626780. Its totient is φ = 80002936032.
The previous prime is 300011010193. The next prime is 300011010259. The reversal of 300011010210 is 12010110003.
It can be written as a sum of positive squares in 2 ways, for example, as 299385159921 + 625850289 = 547161^2 + 25017^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 300011010192 and 300011010201.
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 11 ways as a sum of consecutive naturals, for example, 1666727745 + ... + 1666727924.
Almost surely, 2300011010210 is an apocalyptic number.
300011010210 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
300011010210 is an abundant number, since it is smaller than the sum of its proper divisors (480017616570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
300011010210 is a wasteful number, since it uses less digits than its factorization.
300011010210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3333455682 (or 3333455679 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 300011010210 its reverse (12010110003), we get a palindrome (312021120213).
The spelling of 300011010210 in words is "three hundred billion, eleven million, ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •