Base | Representation |
---|---|
bin | 111001101110… |
… | …0110010010001 |
3 | 2002221121001010 |
4 | 1303130302101 |
5 | 30221430330 |
6 | 3000401133 |
7 | 515146410 |
oct | 163346221 |
9 | 62847033 |
10 | 30264465 |
11 | 160a1160 |
12 | a1761a9 |
13 | 636848a |
14 | 403b477 |
15 | 29cc3b0 |
hex | 1cdcc91 |
30264465 has 32 divisors (see below), whose sum is σ = 60374016. Its totient is φ = 12576960.
The previous prime is 30264461. The next prime is 30264469. The reversal of 30264465 is 56446203.
It is an interprime number because it is at equal distance from previous prime (30264461) and next prime (30264469).
It is not a de Polignac number, because 30264465 - 22 = 30264461 is a prime.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (30264461) 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 in 31 ways as a sum of consecutive naturals, for example, 11947 + ... + 14256.
It is an arithmetic number, because the mean of its divisors is an integer number (1886688).
Almost surely, 230264465 is an apocalyptic number.
30264465 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
30264465 is a deficient number, since it is larger than the sum of its proper divisors (30109551).
30264465 is a wasteful number, since it uses less digits than its factorization.
30264465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26229.
The product of its (nonzero) digits is 17280, while the sum is 30.
The square root of 30264465 is about 5501.3148428353. The cubic root of 30264465 is about 311.6336409031.
The spelling of 30264465 in words is "thirty million, two hundred sixty-four thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •