Base | Representation |
---|---|
bin | 1101101110111100000100… |
… | …11010110001000110011001 |
3 | 10221221002202010000010120201 |
4 | 12313132002122301012121 |
5 | 12424244302344104423 |
6 | 144121422535222201 |
7 | 6234612464652433 |
oct | 667360232610631 |
9 | 127832663003521 |
10 | 30200103113113 |
11 | 969387898a6aa |
12 | 3478b95517961 |
13 | 13b0b1bc21bab |
14 | 76599b02d653 |
15 | 37589231a2ad |
hex | 1b77826b1199 |
30200103113113 has 2 divisors, whose sum is σ = 30200103113114. Its totient is φ = 30200103113112.
The previous prime is 30200103113077. The next prime is 30200103113171. The reversal of 30200103113113 is 31131130100203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 25175637406089 + 5024465707024 = 5017533^2 + 2241532^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30200103113113 is a prime.
It is not a weakly prime, because it can be changed into another prime (30200103119113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15100051556556 + 15100051556557.
It is an arithmetic number, because the mean of its divisors is an integer number (15100051556557).
Almost surely, 230200103113113 is an apocalyptic number.
It is an amenable number.
30200103113113 is a deficient number, since it is larger than the sum of its proper divisors (1).
30200103113113 is an equidigital number, since it uses as much as digits as its factorization.
30200103113113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 30200103113113 its reverse (31131130100203), we get a palindrome (61331233213316).
The spelling of 30200103113113 in words is "thirty trillion, two hundred billion, one hundred three million, one hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •