Base | Representation |
---|---|
bin | 111010010010… |
… | …0101110100101 |
3 | 2010111120021001 |
4 | 1310210232211 |
5 | 30310343031 |
6 | 3010553301 |
7 | 520514464 |
oct | 164445645 |
9 | 63446231 |
10 | 30559141 |
11 | 16282598 |
12 | a298831 |
13 | 643c642 |
14 | 40b69db |
15 | 2a39861 |
hex | 1d24ba5 |
30559141 has 2 divisors, whose sum is σ = 30559142. Its totient is φ = 30559140.
The previous prime is 30559097. The next prime is 30559153. The reversal of 30559141 is 14195503.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28398241 + 2160900 = 5329^2 + 1470^2 .
It is a cyclic number.
It is not a de Polignac number, because 30559141 - 221 = 28461989 is a prime.
It is a super-2 number, since 2×305591412 = 1867722197315762, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30559241) 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, 15279570 + 15279571.
It is an arithmetic number, because the mean of its divisors is an integer number (15279571).
Almost surely, 230559141 is an apocalyptic number.
It is an amenable number.
30559141 is a deficient number, since it is larger than the sum of its proper divisors (1).
30559141 is an equidigital number, since it uses as much as digits as its factorization.
30559141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 28.
The square root of 30559141 is about 5528.0322900649. The cubic root of 30559141 is about 312.6418035905.
The spelling of 30559141 in words is "thirty million, five hundred fifty-nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •