Base | Representation |
---|---|
bin | 111010001100… |
… | …0100011001101 |
3 | 2010102000211122 |
4 | 1310120203031 |
5 | 30302244021 |
6 | 3005530325 |
7 | 520216166 |
oct | 164304315 |
9 | 63360748 |
10 | 30509261 |
11 | 16249072 |
12 | a2739a5 |
13 | 6422a23 |
14 | 40a276d |
15 | 2a29bab |
hex | 1d188cd |
30509261 has 2 divisors, whose sum is σ = 30509262. Its totient is φ = 30509260.
The previous prime is 30509243. The next prime is 30509273. The reversal of 30509261 is 16290503.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22562500 + 7946761 = 4750^2 + 2819^2 .
It is an emirp because it is prime and its reverse (16290503) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30509261 - 214 = 30492877 is a prime.
It is a super-2 number, since 2×305092612 = 1861630013532242, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30509261.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30509221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15254630 + 15254631.
It is an arithmetic number, because the mean of its divisors is an integer number (15254631).
Almost surely, 230509261 is an apocalyptic number.
It is an amenable number.
30509261 is a deficient number, since it is larger than the sum of its proper divisors (1).
30509261 is an equidigital number, since it uses as much as digits as its factorization.
30509261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1620, while the sum is 26.
The square root of 30509261 is about 5523.5188965007. The cubic root of 30509261 is about 312.4716083006.
Adding to 30509261 its reverse (16290503), we get a palindrome (46799764).
The spelling of 30509261 in words is "thirty million, five hundred nine thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •