Base | Representation |
---|---|
bin | 10001111000100… |
… | …001100101010101 |
3 | 202220120010012002 |
4 | 101320201211111 |
5 | 1103301432133 |
6 | 45434405045 |
7 | 10302133613 |
oct | 2170414525 |
9 | 686503162 |
10 | 300030293 |
11 | 1443a5222 |
12 | 84590785 |
13 | 4a20b824 |
14 | 2bbc06b3 |
15 | 1b517ce8 |
hex | 11e21955 |
300030293 has 2 divisors, whose sum is σ = 300030294. Its totient is φ = 300030292.
The previous prime is 300030287. The next prime is 300030329. The reversal of 300030293 is 392030003.
Together with next prime (300030329) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 167365969 + 132664324 = 12937^2 + 11518^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-300030293 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (300030223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 150015146 + 150015147.
It is an arithmetic number, because the mean of its divisors is an integer number (150015147).
Almost surely, 2300030293 is an apocalyptic number.
It is an amenable number.
300030293 is a deficient number, since it is larger than the sum of its proper divisors (1).
300030293 is an equidigital number, since it uses as much as digits as its factorization.
300030293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 20.
The square root of 300030293 is about 17321.3825371995. The cubic root of 300030293 is about 669.4554816931.
Adding to 300030293 its reverse (392030003), we get a palindrome (692060296).
The spelling of 300030293 in words is "three hundred million, thirty thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •