Base | Representation |
---|---|
bin | 11011111100110111… |
… | …101010000000110001 |
3 | 2212110121100101020122 |
4 | 123330313222000301 |
5 | 442431114032314 |
6 | 21442030420025 |
7 | 2111505635402 |
oct | 337467520061 |
9 | 85417311218 |
10 | 30012252209 |
11 | 11801152325 |
12 | 5997061615 |
13 | 2aa3a94b24 |
14 | 1649d179a9 |
15 | ba9c4928e |
hex | 6fcdea031 |
30012252209 has 2 divisors, whose sum is σ = 30012252210. Its totient is φ = 30012252208.
The previous prime is 30012252157. The next prime is 30012252211. The reversal of 30012252209 is 90225221003.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15215962609 + 14796289600 = 123353^2 + 121640^2 .
It is an emirp because it is prime and its reverse (90225221003) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30012252209 - 232 = 25717284913 is a prime.
It is a super-3 number, since 3×300122522093 (a number of 32 digits) contains 333 as substring.
Together with 30012252211, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (30012252229) 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 as a sum of consecutive naturals, namely, 15006126104 + 15006126105.
It is an arithmetic number, because the mean of its divisors is an integer number (15006126105).
Almost surely, 230012252209 is an apocalyptic number.
It is an amenable number.
30012252209 is a deficient number, since it is larger than the sum of its proper divisors (1).
30012252209 is an equidigital number, since it uses as much as digits as its factorization.
30012252209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 26.
The spelling of 30012252209 in words is "thirty billion, twelve million, two hundred fifty-two thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •