Base | Representation |
---|---|
bin | 111001110010… |
… | …1010000101101 |
3 | 2010000100122220 |
4 | 1303211100231 |
5 | 30224033211 |
6 | 3001225553 |
7 | 515352543 |
oct | 163452055 |
9 | 63010586 |
10 | 30299181 |
11 | 16115250 |
12 | a1922b9 |
13 | 637b213 |
14 | 4049d93 |
15 | 29d7806 |
hex | 1ce542d |
30299181 has 8 divisors (see below), whose sum is σ = 44071584. Its totient is φ = 18363120.
The previous prime is 30299141. The next prime is 30299197. The reversal of 30299181 is 18199203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30299181 - 210 = 30298157 is a prime.
It is a super-2 number, since 2×302991812 = 1836080738541522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 918157 = 30299181 / (3 + 0 + 2 + 9 + 9 + 1 + 8 + 1).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30299131) 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 7 ways as a sum of consecutive naturals, for example, 459046 + ... + 459111.
It is an arithmetic number, because the mean of its divisors is an integer number (5508948).
Almost surely, 230299181 is an apocalyptic number.
It is an amenable number.
30299181 is a deficient number, since it is larger than the sum of its proper divisors (13772403).
30299181 is a wasteful number, since it uses less digits than its factorization.
30299181 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 918171.
The product of its (nonzero) digits is 3888, while the sum is 33.
The square root of 30299181 is about 5504.4691842175. The cubic root of 30299181 is about 311.7527524249.
The spelling of 30299181 in words is "thirty million, two hundred ninety-nine thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •