Base | Representation |
---|---|
bin | 111010010001… |
… | …0101110101001 |
3 | 2010111011000210 |
4 | 1310202232221 |
5 | 30310112303 |
6 | 3010451333 |
7 | 520451556 |
oct | 164425651 |
9 | 63434023 |
10 | 30550953 |
11 | 16277424 |
12 | a293b49 |
13 | 64389b4 |
14 | 40b3a2d |
15 | 2a37203 |
hex | 1d22ba9 |
30550953 has 4 divisors (see below), whose sum is σ = 40734608. Its totient is φ = 20367300.
The previous prime is 30550943. The next prime is 30550963. The reversal of 30550953 is 35905503.
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.
It is an interprime number because it is at equal distance from previous prime (30550943) and next prime (30550963).
It is not a de Polignac number, because 30550953 - 218 = 30288809 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30550953.
It is not an unprimeable number, because it can be changed into a prime (30550913) 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 3 ways as a sum of consecutive naturals, for example, 5091823 + ... + 5091828.
It is an arithmetic number, because the mean of its divisors is an integer number (10183652).
Almost surely, 230550953 is an apocalyptic number.
It is an amenable number.
30550953 is a deficient number, since it is larger than the sum of its proper divisors (10183655).
30550953 is a wasteful number, since it uses less digits than its factorization.
30550953 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10183654.
The product of its (nonzero) digits is 10125, while the sum is 30.
The square root of 30550953 is about 5527.2916514329. The cubic root of 30550953 is about 312.6138780700.
The spelling of 30550953 in words is "thirty million, five hundred fifty thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •