Base | Representation |
---|---|
bin | 1000101111001101010… |
… | …00110011100011001100 |
3 | 1001200221000000221212012 |
4 | 10113212220303203030 |
5 | 14404323340400022 |
6 | 345530431400352 |
7 | 30455533410650 |
oct | 4274650634314 |
9 | 1050830027765 |
10 | 300222200012 |
11 | 106361672479 |
12 | 4a2279830b8 |
13 | 22406b897c7 |
14 | 10760862a60 |
15 | 7c21e50de2 |
hex | 45e6a338cc |
300222200012 has 48 divisors (see below), whose sum is σ = 601577131008. Its totient is φ = 128424139200.
The previous prime is 300222200011. The next prime is 300222200017. The reversal of 300222200012 is 210002222003.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a self number, because there is not a number n which added to its sum of digits gives 300222200012.
It is not an unprimeable number, because it can be changed into a prime (300222200011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 56103137 + ... + 56108487.
It is an arithmetic number, because the mean of its divisors is an integer number (12532856896).
Almost surely, 2300222200012 is an apocalyptic number.
It is an amenable number.
300222200012 is an abundant number, since it is smaller than the sum of its proper divisors (301354930996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
300222200012 is a wasteful number, since it uses less digits than its factorization.
300222200012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8766 (or 8764 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 14.
Adding to 300222200012 its reverse (210002222003), we get a palindrome (510224422015).
The spelling of 300222200012 in words is "three hundred billion, two hundred twenty-two million, two hundred thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •