Base | Representation |
---|---|
bin | 111010001011… |
… | …0010011000001 |
3 | 2010101120011212 |
4 | 1310112103001 |
5 | 30302000113 |
6 | 3005415505 |
7 | 520150244 |
oct | 164262301 |
9 | 63346155 |
10 | 30500033 |
11 | 16242143 |
12 | a26a595 |
13 | 641b775 |
14 | 409d25b |
15 | 2a270a8 |
hex | 1d164c1 |
30500033 has 4 divisors (see below), whose sum is σ = 30842820. Its totient is φ = 30157248.
The previous prime is 30500011. The next prime is 30500059. The reversal of 30500033 is 33000503.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8334769 + 22165264 = 2887^2 + 4708^2 .
It is a cyclic number.
It is not a de Polignac number, because 30500033 - 26 = 30499969 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30499990 and 30500017.
It is not an unprimeable number, because it can be changed into a prime (30500003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 171260 + ... + 171437.
It is an arithmetic number, because the mean of its divisors is an integer number (7710705).
Almost surely, 230500033 is an apocalyptic number.
It is an amenable number.
30500033 is a deficient number, since it is larger than the sum of its proper divisors (342787).
30500033 is an equidigital number, since it uses as much as digits as its factorization.
30500033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 342786.
The product of its (nonzero) digits is 135, while the sum is 14.
The square root of 30500033 is about 5522.6834962724. The cubic root of 30500033 is about 312.4401011595.
Adding to 30500033 its reverse (33000503), we get a palindrome (63500536).
The spelling of 30500033 in words is "thirty million, five hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •