Base | Representation |
---|---|
bin | 1101101001001101010100… |
… | …10000011111000110011101 |
3 | 10221020021111210201120112011 |
4 | 12310212222100133012131 |
5 | 12413033024432322343 |
6 | 143451140422511221 |
7 | 6214442224466503 |
oct | 664465220370635 |
9 | 127207453646464 |
10 | 30003203010973 |
11 | 9618317a10665 |
12 | 34469a3b95511 |
13 | 139839cbc340a |
14 | 75a23c91a673 |
15 | 3706bb0be29d |
hex | 1b49aa41f19d |
30003203010973 has 2 divisors, whose sum is σ = 30003203010974. Its totient is φ = 30003203010972.
The previous prime is 30003203010947. The next prime is 30003203011057. The reversal of 30003203010973 is 37901030230003.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27602382917209 + 2400820093764 = 5253797^2 + 1549458^2 .
It is a cyclic number.
It is not a de Polignac number, because 30003203010973 - 213 = 30003203002781 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30003203010373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15001601505486 + 15001601505487.
It is an arithmetic number, because the mean of its divisors is an integer number (15001601505487).
Almost surely, 230003203010973 is an apocalyptic number.
It is an amenable number.
30003203010973 is a deficient number, since it is larger than the sum of its proper divisors (1).
30003203010973 is an equidigital number, since it uses as much as digits as its factorization.
30003203010973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10206, while the sum is 31.
Adding to 30003203010973 its reverse (37901030230003), we get a palindrome (67904233240976).
The spelling of 30003203010973 in words is "thirty trillion, three billion, two hundred three million, ten thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •