Base | Representation |
---|---|
bin | 111001110010… |
… | …1011111011001 |
3 | 2010000101221201 |
4 | 1303211133121 |
5 | 30224100441 |
6 | 3001234201 |
7 | 515355355 |
oct | 163453731 |
9 | 63011851 |
10 | 30300121 |
11 | 16115a25 |
12 | a192961 |
13 | 637b787 |
14 | 404a465 |
15 | 29d7c31 |
hex | 1ce57d9 |
30300121 has 2 divisors, whose sum is σ = 30300122. Its totient is φ = 30300120.
The previous prime is 30300119. The next prime is 30300143. The reversal of 30300121 is 12100303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17598025 + 12702096 = 4195^2 + 3564^2 .
It is an emirp because it is prime and its reverse (12100303) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30300121 - 21 = 30300119 is a prime.
It is a super-2 number, since 2×303001212 = 1836194665229282, which contains 22 as substring.
Together with 30300119, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 30300098 and 30300107.
It is not a weakly prime, because it can be changed into another prime (30300191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15150060 + 15150061.
It is an arithmetic number, because the mean of its divisors is an integer number (15150061).
Almost surely, 230300121 is an apocalyptic number.
It is an amenable number.
30300121 is a deficient number, since it is larger than the sum of its proper divisors (1).
30300121 is an equidigital number, since it uses as much as digits as its factorization.
30300121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 10.
The square root of 30300121 is about 5504.5545687185. The cubic root of 30300121 is about 311.7559763246.
Adding to 30300121 its reverse (12100303), we get a palindrome (42400424).
The spelling of 30300121 in words is "thirty million, three hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •