Base | Representation |
---|---|
bin | 11100000010001110… |
… | …111100001101001011 |
3 | 2212200212200100012102 |
4 | 130002032330031023 |
5 | 443122133221443 |
6 | 21455003304015 |
7 | 2113650556562 |
oct | 340216741513 |
9 | 85625610172 |
10 | 30102242123 |
11 | 11847a27058 |
12 | 5a0121b00b |
13 | 2ab96122b5 |
14 | 1657c60bd9 |
15 | bb2ac2cb8 |
hex | 7023bc34b |
30102242123 has 2 divisors, whose sum is σ = 30102242124. Its totient is φ = 30102242122.
The previous prime is 30102242083. The next prime is 30102242141. The reversal of 30102242123 is 32124220103.
It is a strong prime.
It is an emirp because it is prime and its reverse (32124220103) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30102242123 is a prime.
It is a super-2 number, since 2×301022421232 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30102242095 and 30102242104.
It is not a weakly prime, because it can be changed into another prime (30102242143) 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, 15051121061 + 15051121062.
It is an arithmetic number, because the mean of its divisors is an integer number (15051121062).
Almost surely, 230102242123 is an apocalyptic number.
30102242123 is a deficient number, since it is larger than the sum of its proper divisors (1).
30102242123 is an equidigital number, since it uses as much as digits as its factorization.
30102242123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 30102242123 its reverse (32124220103), we get a palindrome (62226462226).
The spelling of 30102242123 in words is "thirty billion, one hundred two million, two hundred forty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •