Base | Representation |
---|---|
bin | 1101101001001101001011… |
… | …11011001100110001100101 |
3 | 10221020021022201221121000202 |
4 | 12310212211323030301211 |
5 | 12413032402330301041 |
6 | 143451125304520245 |
7 | 6214440352603403 |
oct | 664464573146145 |
9 | 127207281847022 |
10 | 30003130322021 |
11 | 961828a98334a |
12 | 3446983780085 |
13 | 139838ab229bc |
14 | 75a232dd8473 |
15 | 3706b4a11a9b |
hex | 1b49a5eccc65 |
30003130322021 has 2 divisors, whose sum is σ = 30003130322022. Its totient is φ = 30003130322020.
The previous prime is 30003130321961. The next prime is 30003130322029. The reversal of 30003130322021 is 12022303130003.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25120294360225 + 4882835961796 = 5012015^2 + 2209714^2 .
It is a cyclic number.
It is not a de Polignac number, because 30003130322021 - 214 = 30003130305637 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30003130321984 and 30003130322002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30003130322029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15001565161010 + 15001565161011.
It is an arithmetic number, because the mean of its divisors is an integer number (15001565161011).
Almost surely, 230003130322021 is an apocalyptic number.
It is an amenable number.
30003130322021 is a deficient number, since it is larger than the sum of its proper divisors (1).
30003130322021 is an equidigital number, since it uses as much as digits as its factorization.
30003130322021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 30003130322021 its reverse (12022303130003), we get a palindrome (42025433452024).
The spelling of 30003130322021 in words is "thirty trillion, three billion, one hundred thirty million, three hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •