Base | Representation |
---|---|
bin | 1101101111001110101110… |
… | …00011111000011111001101 |
3 | 10221222001120201120202121201 |
4 | 12313213113003320133031 |
5 | 12424430302424041023 |
6 | 144130200120225501 |
7 | 6235415523360622 |
oct | 667472703703715 |
9 | 127861521522551 |
10 | 30210113112013 |
11 | 9698045303a6a |
12 | 347ab0990b291 |
13 | 13b1a55a00573 |
14 | 76626a636349 |
15 | 375c7b000bad |
hex | 1b79d70f87cd |
30210113112013 has 2 divisors, whose sum is σ = 30210113112014. Its totient is φ = 30210113112012.
The previous prime is 30210113112007. The next prime is 30210113112097. The reversal of 30210113112013 is 31021131101203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 26551316923209 + 3658796188804 = 5152797^2 + 1912798^2 .
It is an emirp because it is prime and its reverse (31021131101203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30210113112013 - 217 = 30210112980941 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30210113112913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15105056556006 + 15105056556007.
It is an arithmetic number, because the mean of its divisors is an integer number (15105056556007).
Almost surely, 230210113112013 is an apocalyptic number.
It is an amenable number.
30210113112013 is a deficient number, since it is larger than the sum of its proper divisors (1).
30210113112013 is an equidigital number, since it uses as much as digits as its factorization.
30210113112013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 30210113112013 its reverse (31021131101203), we get a palindrome (61231244213216).
The spelling of 30210113112013 in words is "thirty trillion, two hundred ten billion, one hundred thirteen million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.153 sec. • engine limits •