Base | Representation |
---|---|
bin | 111010000011… |
… | …1011100111101 |
3 | 2010021110202212 |
4 | 1310013130331 |
5 | 30243023404 |
6 | 3004230205 |
7 | 516505052 |
oct | 164073475 |
9 | 63243685 |
10 | 30439229 |
11 | 16200497 |
12 | a23b365 |
13 | 63c9ba2 |
14 | 4085029 |
15 | 2a1406e |
hex | 1d0773d |
30439229 has 4 divisors (see below), whose sum is σ = 30489984. Its totient is φ = 30388476.
The previous prime is 30439219. The next prime is 30439237. The reversal of 30439229 is 92293403.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 92293403 = 9157 ⋅10079.
It is a cyclic number.
It is not a de Polignac number, because 30439229 - 212 = 30435133 is a prime.
It is a super-2 number, since 2×304392292 = 1853093324228882, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30439195 and 30439204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30439219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24467 + ... + 25680.
It is an arithmetic number, because the mean of its divisors is an integer number (7622496).
Almost surely, 230439229 is an apocalyptic number.
It is an amenable number.
30439229 is a deficient number, since it is larger than the sum of its proper divisors (50755).
30439229 is an equidigital number, since it uses as much as digits as its factorization.
30439229 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50754.
The product of its (nonzero) digits is 11664, while the sum is 32.
The square root of 30439229 is about 5517.1758173906. The cubic root of 30439229 is about 312.2323391300.
The spelling of 30439229 in words is "thirty million, four hundred thirty-nine thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •