Base | Representation |
---|---|
bin | 111001110011… |
… | …1111011101001 |
3 | 2010000220200002 |
4 | 1303213323221 |
5 | 30224410441 |
6 | 3001352345 |
7 | 515426462 |
oct | 163477351 |
9 | 63026602 |
10 | 30310121 |
11 | 16122496 |
12 | a1986b5 |
13 | 63831aa |
14 | 404dd69 |
15 | 29dab9b |
hex | 1ce7ee9 |
30310121 has 2 divisors, whose sum is σ = 30310122. Its totient is φ = 30310120.
The previous prime is 30310097. The next prime is 30310123. The reversal of 30310121 is 12101303.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20475625 + 9834496 = 4525^2 + 3136^2 .
It is an emirp because it is prime and its reverse (12101303) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30310121 - 26 = 30310057 is a prime.
It is a Sophie Germain prime.
Together with 30310123, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (30310123) 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 as a sum of consecutive naturals, namely, 15155060 + 15155061.
It is an arithmetic number, because the mean of its divisors is an integer number (15155061).
Almost surely, 230310121 is an apocalyptic number.
It is an amenable number.
30310121 is a deficient number, since it is larger than the sum of its proper divisors (1).
30310121 is an equidigital number, since it uses as much as digits as its factorization.
30310121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 11.
The square root of 30310121 is about 5505.4628324965. The cubic root of 30310121 is about 311.7902690024.
Adding to 30310121 its reverse (12101303), we get a palindrome (42411424).
The spelling of 30310121 in words is "thirty million, three hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •