Base | Representation |
---|---|
bin | 11100000011010110… |
… | …100111001001000101 |
3 | 2212202012000212121121 |
4 | 130003112213021011 |
5 | 443141440431323 |
6 | 21500514113541 |
7 | 2114266350421 |
oct | 340326471105 |
9 | 85665025547 |
10 | 30121030213 |
11 | 118575998aa |
12 | 5a0757b8b1 |
13 | 2ac048cc01 |
14 | 165a551b81 |
15 | bb4584a5d |
hex | 7035a7245 |
30121030213 has 2 divisors, whose sum is σ = 30121030214. Its totient is φ = 30121030212.
The previous prime is 30121030129. The next prime is 30121030229. The reversal of 30121030213 is 31203012103.
It is an a-pointer prime, because the next prime (30121030229) can be obtained adding 30121030213 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28212913089 + 1908117124 = 167967^2 + 43682^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30121030213 is a prime.
It is a super-2 number, since 2×301210302132 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30121030813) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15060515106 + 15060515107.
It is an arithmetic number, because the mean of its divisors is an integer number (15060515107).
Almost surely, 230121030213 is an apocalyptic number.
It is an amenable number.
30121030213 is a deficient number, since it is larger than the sum of its proper divisors (1).
30121030213 is an equidigital number, since it uses as much as digits as its factorization.
30121030213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 30121030213 its reverse (31203012103), we get a palindrome (61324042316).
The spelling of 30121030213 in words is "thirty billion, one hundred twenty-one million, thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •