Base | Representation |
---|---|
bin | 11100000011111010… |
… | …000000111111100001 |
3 | 2212202211111101122112 |
4 | 130003322000333201 |
5 | 443201324424022 |
6 | 21501445045105 |
7 | 2114441263463 |
oct | 340372007741 |
9 | 85684441575 |
10 | 30130311137 |
11 | 11861858793 |
12 | 5a0a6b6795 |
13 | 2ac238c394 |
14 | 165b88a133 |
15 | bb52b98e2 |
hex | 703e80fe1 |
30130311137 has 2 divisors, whose sum is σ = 30130311138. Its totient is φ = 30130311136.
The previous prime is 30130311091. The next prime is 30130311139. The reversal of 30130311137 is 73111303103.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 23433180241 + 6697130896 = 153079^2 + 81836^2 .
It is a cyclic number.
It is not a de Polignac number, because 30130311137 - 216 = 30130245601 is a prime.
Together with 30130311139, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (30130311139) 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, 15065155568 + 15065155569.
It is an arithmetic number, because the mean of its divisors is an integer number (15065155569).
Almost surely, 230130311137 is an apocalyptic number.
It is an amenable number.
30130311137 is a deficient number, since it is larger than the sum of its proper divisors (1).
30130311137 is an equidigital number, since it uses as much as digits as its factorization.
30130311137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567, while the sum is 23.
The spelling of 30130311137 in words is "thirty billion, one hundred thirty million, three hundred eleven thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •