Base | Representation |
---|---|
bin | 111010111110… |
… | …0100111011011 |
3 | 2011011212002000 |
4 | 1311330213123 |
5 | 30403403011 |
6 | 3022412043 |
7 | 523544145 |
oct | 165744733 |
9 | 64155060 |
10 | 30919131 |
11 | 164a9001 |
12 | a431023 |
13 | 6537459 |
14 | 416bc95 |
15 | 2aab356 |
hex | 1d7c9db |
30919131 has 16 divisors (see below), whose sum is σ = 46559520. Its totient is φ = 20273760.
The previous prime is 30919123. The next prime is 30919159. The reversal of 30919131 is 13191903.
It is not a de Polignac number, because 30919131 - 23 = 30919123 is a prime.
It is a super-2 number, since 2×309191312 = 1911985323590322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 30919095 and 30919104.
It is not an unprimeable number, because it can be changed into a prime (30919331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7740 + ... + 11033.
It is an arithmetic number, because the mean of its divisors is an integer number (2909970).
Almost surely, 230919131 is an apocalyptic number.
30919131 is a deficient number, since it is larger than the sum of its proper divisors (15640389).
30919131 is a wasteful number, since it uses less digits than its factorization.
30919131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18843 (or 18837 counting only the distinct ones).
The product of its (nonzero) digits is 729, while the sum is 27.
The square root of 30919131 is about 5560.4973698402. The cubic root of 30919131 is about 313.8646657383.
The spelling of 30919131 in words is "thirty million, nine hundred nineteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •