Base | Representation |
---|---|
bin | 10001111001001… |
… | …101111100101101 |
3 | 202220220100110110 |
4 | 101321031330231 |
5 | 1103323241023 |
6 | 45442330233 |
7 | 10303521453 |
oct | 2171157455 |
9 | 686810413 |
10 | 300212013 |
11 | 144509802 |
12 | 84659979 |
13 | 4a27345a |
14 | 2bc2a9d3 |
15 | 1b551a93 |
hex | 11e4df2d |
300212013 has 8 divisors (see below), whose sum is σ = 401944576. Its totient is φ = 199310400.
The previous prime is 300211991. The next prime is 300212021. The reversal of 300212013 is 310212003.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 300212013 - 26 = 300211949 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 300212013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (300212023) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 206893 + ... + 208338.
It is an arithmetic number, because the mean of its divisors is an integer number (50243072).
Almost surely, 2300212013 is an apocalyptic number.
It is an amenable number.
300212013 is a deficient number, since it is larger than the sum of its proper divisors (101732563).
300212013 is a wasteful number, since it uses less digits than its factorization.
300212013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 415475.
The product of its (nonzero) digits is 36, while the sum is 12.
The square root of 300212013 is about 17326.6272828846. The cubic root of 300212013 is about 669.5906112678.
Adding to 300212013 its reverse (310212003), we get a palindrome (610424016).
The spelling of 300212013 in words is "three hundred million, two hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •