Base | Representation |
---|---|
bin | 11100000100100111… |
… | …000010010101110001 |
3 | 2212210122200222221122 |
4 | 130010213002111301 |
5 | 443212340110022 |
6 | 21502550032025 |
7 | 2114643506603 |
oct | 340447022561 |
9 | 85718628848 |
10 | 30142113137 |
11 | 11868489804 |
12 | 5a12648615 |
13 | 2ac4962206 |
14 | 165d27d173 |
15 | bb634b742 |
hex | 7049c2571 |
30142113137 has 2 divisors, whose sum is σ = 30142113138. Its totient is φ = 30142113136.
The previous prime is 30142113121. The next prime is 30142113149. The reversal of 30142113137 is 73131124103.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16816643041 + 13325470096 = 129679^2 + 115436^2 .
It is an emirp because it is prime and its reverse (73131124103) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30142113137 - 24 = 30142113121 is a prime.
It is not a weakly prime, because it can be changed into another prime (30142113167) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15071056568 + 15071056569.
It is an arithmetic number, because the mean of its divisors is an integer number (15071056569).
Almost surely, 230142113137 is an apocalyptic number.
It is an amenable number.
30142113137 is a deficient number, since it is larger than the sum of its proper divisors (1).
30142113137 is an equidigital number, since it uses as much as digits as its factorization.
30142113137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 26.
The spelling of 30142113137 in words is "thirty billion, one hundred forty-two million, one hundred thirteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •