Base | Representation |
---|---|
bin | 11100001000001100… |
… | …010000010000100011 |
3 | 2212221211202210011121 |
4 | 130020030100100203 |
5 | 443323230413443 |
6 | 21512533553111 |
7 | 2116303321333 |
oct | 341014202043 |
9 | 85854683147 |
10 | 30202201123 |
11 | 1189939a7a6 |
12 | 5a2a7a5797 |
13 | 2b04240233 |
14 | 16672410c3 |
15 | bbb76a4ed |
hex | 708310423 |
30202201123 has 2 divisors, whose sum is σ = 30202201124. Its totient is φ = 30202201122.
The previous prime is 30202201087. The next prime is 30202201181. The reversal of 30202201123 is 32110220203.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30202201123 is a prime.
It is a super-2 number, since 2×302022011232 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30202201097 and 30202201106.
It is not a weakly prime, because it can be changed into another prime (30202201223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15101100561 + 15101100562.
It is an arithmetic number, because the mean of its divisors is an integer number (15101100562).
Almost surely, 230202201123 is an apocalyptic number.
30202201123 is a deficient number, since it is larger than the sum of its proper divisors (1).
30202201123 is an equidigital number, since it uses as much as digits as its factorization.
30202201123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 30202201123 its reverse (32110220203), we get a palindrome (62312421326).
The spelling of 30202201123 in words is "thirty billion, two hundred two million, two hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •