Base | Representation |
---|---|
bin | 111010111100… |
… | …0100000101101 |
3 | 2011011000000021 |
4 | 1311320200231 |
5 | 30402333232 |
6 | 3022202141 |
7 | 523444135 |
oct | 165704055 |
9 | 64130007 |
10 | 30902317 |
11 | 16497406 |
12 | a423351 |
13 | 652c8c4 |
14 | 4165ac5 |
15 | 2aa6397 |
hex | 1d7882d |
30902317 has 4 divisors (see below), whose sum is σ = 32245920. Its totient is φ = 29558716.
The previous prime is 30902309. The next prime is 30902321. The reversal of 30902317 is 71320903.
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: 71320903 = 227 ⋅314189.
It is a cyclic number.
It is not a de Polignac number, because 30902317 - 23 = 30902309 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30902291 and 30902300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30902327) 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, 671767 + ... + 671812.
It is an arithmetic number, because the mean of its divisors is an integer number (8061480).
Almost surely, 230902317 is an apocalyptic number.
It is an amenable number.
30902317 is a deficient number, since it is larger than the sum of its proper divisors (1343603).
30902317 is a wasteful number, since it uses less digits than its factorization.
30902317 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1343602.
The product of its (nonzero) digits is 1134, while the sum is 25.
The square root of 30902317 is about 5558.9852491260. The cubic root of 30902317 is about 313.8077616230.
The spelling of 30902317 in words is "thirty million, nine hundred two thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •