Base | Representation |
---|---|
bin | 1101101110111111110100… |
… | …00011010100001000001101 |
3 | 10221221021220222202021210012 |
4 | 12313133322003110020031 |
5 | 12424312410204343203 |
6 | 144122354034523005 |
7 | 6235013306121305 |
oct | 667377203241015 |
9 | 127837828667705 |
10 | 30202110231053 |
11 | 9694708949062 |
12 | 3479455736465 |
13 | 13b107b9bc047 |
14 | 765b0b81c605 |
15 | 37595d636bd8 |
hex | 1b77fa0d420d |
30202110231053 has 2 divisors, whose sum is σ = 30202110231054. Its totient is φ = 30202110231052.
The previous prime is 30202110231043. The next prime is 30202110231107. The reversal of 30202110231053 is 35013201120203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 25226078818249 + 4976031412804 = 5022557^2 + 2230702^2 .
It is an emirp because it is prime and its reverse (35013201120203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30202110231053 - 24 = 30202110231037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30202110231043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15101055115526 + 15101055115527.
It is an arithmetic number, because the mean of its divisors is an integer number (15101055115527).
Almost surely, 230202110231053 is an apocalyptic number.
It is an amenable number.
30202110231053 is a deficient number, since it is larger than the sum of its proper divisors (1).
30202110231053 is an equidigital number, since it uses as much as digits as its factorization.
30202110231053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 30202110231053 its reverse (35013201120203), we get a palindrome (65215311351256).
The spelling of 30202110231053 in words is "thirty trillion, two hundred two billion, one hundred ten million, two hundred thirty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •