Base | Representation |
---|---|
bin | 11100001000001011… |
… | …011111011011011001 |
3 | 2212221211101121210211 |
4 | 130020023133123121 |
5 | 443323203013423 |
6 | 21512525411121 |
7 | 2116301526244 |
oct | 341013373331 |
9 | 85854347724 |
10 | 30202001113 |
11 | 118992734a9 |
12 | 5a2a709aa1 |
13 | 2b041a019b |
14 | 16671cc25b |
15 | bbb72b10d |
hex | 7082df6d9 |
30202001113 has 2 divisors, whose sum is σ = 30202001114. Its totient is φ = 30202001112.
The previous prime is 30202001107. The next prime is 30202001119. The reversal of 30202001113 is 31110020203.
It is a balanced prime because it is at equal distance from previous prime (30202001107) and next prime (30202001119).
It can be written as a sum of positive squares in only one way, i.e., 28119265344 + 2082735769 = 167688^2 + 45637^2 .
It is a cyclic number.
It is not a de Polignac number, because 30202001113 - 233 = 21612066521 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30202001093 and 30202001102.
It is not a weakly prime, because it can be changed into another prime (30202001119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15101000556 + 15101000557.
It is an arithmetic number, because the mean of its divisors is an integer number (15101000557).
Almost surely, 230202001113 is an apocalyptic number.
It is an amenable number.
30202001113 is a deficient number, since it is larger than the sum of its proper divisors (1).
30202001113 is an equidigital number, since it uses as much as digits as its factorization.
30202001113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 30202001113 its reverse (31110020203), we get a palindrome (61312021316).
The spelling of 30202001113 in words is "thirty billion, two hundred two million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •