Base | Representation |
---|---|
bin | 111010001011… |
… | …0110100100101 |
3 | 2010101200010102 |
4 | 1310112310211 |
5 | 30302032211 |
6 | 3005433445 |
7 | 520156433 |
oct | 164266445 |
9 | 63350112 |
10 | 30502181 |
11 | 16243816 |
12 | a26b885 |
13 | 641c738 |
14 | 409dd53 |
15 | 2a27a3b |
hex | 1d16d25 |
30502181 has 2 divisors, whose sum is σ = 30502182. Its totient is φ = 30502180.
The previous prime is 30502177. The next prime is 30502187. The reversal of 30502181 is 18120503.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21077281 + 9424900 = 4591^2 + 3070^2 .
It is an emirp because it is prime and its reverse (18120503) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30502181 - 22 = 30502177 is a prime.
It is a super-2 number, since 2×305021812 = 1860766091513522, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30502187) 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 as a sum of consecutive naturals, namely, 15251090 + 15251091.
It is an arithmetic number, because the mean of its divisors is an integer number (15251091).
Almost surely, 230502181 is an apocalyptic number.
It is an amenable number.
30502181 is a deficient number, since it is larger than the sum of its proper divisors (1).
30502181 is an equidigital number, since it uses as much as digits as its factorization.
30502181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 20.
The square root of 30502181 is about 5522.8779635259. The cubic root of 30502181 is about 312.4474356389.
Adding to 30502181 its reverse (18120503), we get a palindrome (48622684).
The spelling of 30502181 in words is "thirty million, five hundred two thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •