Base | Representation |
---|---|
bin | 111010010001… |
… | …0100110100001 |
3 | 2010111010022112 |
4 | 1310202212201 |
5 | 30310103213 |
6 | 3010445105 |
7 | 520450214 |
oct | 164424641 |
9 | 63433275 |
10 | 30550433 |
11 | 16276aa1 |
12 | a293795 |
13 | 64386a4 |
14 | 40b377b |
15 | 2a36ea8 |
hex | 1d229a1 |
30550433 has 2 divisors, whose sum is σ = 30550434. Its totient is φ = 30550432.
The previous prime is 30550397. The next prime is 30550439. The reversal of 30550433 is 33405503.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30547729 + 2704 = 5527^2 + 52^2 .
It is an emirp because it is prime and its reverse (33405503) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30550433 - 216 = 30484897 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 30550399 and 30550408.
It is not a weakly prime, because it can be changed into another prime (30550439) 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 as a sum of consecutive naturals, namely, 15275216 + 15275217.
It is an arithmetic number, because the mean of its divisors is an integer number (15275217).
Almost surely, 230550433 is an apocalyptic number.
It is an amenable number.
30550433 is a deficient number, since it is larger than the sum of its proper divisors (1).
30550433 is an equidigital number, since it uses as much as digits as its factorization.
30550433 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 23.
The square root of 30550433 is about 5527.2446119201. The cubic root of 30550433 is about 312.6121044195.
Adding to 30550433 its reverse (33405503), we get a palindrome (63955936).
The spelling of 30550433 in words is "thirty million, five hundred fifty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •