Base | Representation |
---|---|
bin | 1101101110111111101010… |
… | …11101001000100000011001 |
3 | 10221221021201121122021212012 |
4 | 12313133311131020200121 |
5 | 12424312230434104423 |
6 | 144122342241555305 |
7 | 6235011351460541 |
oct | 667376535104031 |
9 | 127837647567765 |
10 | 30202033113113 |
11 | 9694679366224 |
12 | 3479433945b35 |
13 | 13b1068a2a724 |
14 | 765b014a6321 |
15 | 3759569a2078 |
hex | 1b77f5748819 |
30202033113113 has 2 divisors, whose sum is σ = 30202033113114. Its totient is φ = 30202033113112.
The previous prime is 30202033113107. The next prime is 30202033113127. The reversal of 30202033113113 is 31131133020203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29846248301584 + 355784811529 = 5463172^2 + 596477^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30202033113113 is a prime.
It is not a weakly prime, because it can be changed into another prime (30202033113913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15101016556556 + 15101016556557.
It is an arithmetic number, because the mean of its divisors is an integer number (15101016556557).
Almost surely, 230202033113113 is an apocalyptic number.
It is an amenable number.
30202033113113 is a deficient number, since it is larger than the sum of its proper divisors (1).
30202033113113 is an equidigital number, since it uses as much as digits as its factorization.
30202033113113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 30202033113113 its reverse (31131133020203), we get a palindrome (61333166133316).
It can be divided in two parts, 3020203 and 3113113, that added together give a palindrome (6133316).
The spelling of 30202033113113 in words is "thirty trillion, two hundred two billion, thirty-three million, one hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •