Base | Representation |
---|---|
bin | 1101101110111101110010… |
… | …00100111010111010010101 |
3 | 10221221012010000112120101201 |
4 | 12313132321010322322111 |
5 | 12424303142123224023 |
6 | 144122053534152501 |
7 | 6234644301336022 |
oct | 667367104727225 |
9 | 127835100476351 |
10 | 30201020133013 |
11 | 96941a9587294 |
12 | 34791b0652731 |
13 | 13b0c36bc7412 |
14 | 765a46b3a549 |
15 | 3758e7aa9bad |
hex | 1b77b913ae95 |
30201020133013 has 2 divisors, whose sum is σ = 30201020133014. Its totient is φ = 30201020133012.
The previous prime is 30201020133001. The next prime is 30201020133059. The reversal of 30201020133013 is 31033102010203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16958393455249 + 13242626677764 = 4118057^2 + 3639042^2 .
It is an emirp because it is prime and its reverse (31033102010203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30201020133013 - 233 = 30192430198421 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30201020133313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15100510066506 + 15100510066507.
It is an arithmetic number, because the mean of its divisors is an integer number (15100510066507).
Almost surely, 230201020133013 is an apocalyptic number.
It is an amenable number.
30201020133013 is a deficient number, since it is larger than the sum of its proper divisors (1).
30201020133013 is an equidigital number, since it uses as much as digits as its factorization.
30201020133013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 30201020133013 its reverse (31033102010203), we get a palindrome (61234122143216).
The spelling of 30201020133013 in words is "thirty trillion, two hundred one billion, twenty million, one hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •