Base | Representation |
---|---|
bin | 1101101110111101110010… |
… | …00100011010101110111011 |
3 | 10221221012010000021212121011 |
4 | 12313132321010122232323 |
5 | 12424303142110014321 |
6 | 144122053531254351 |
7 | 6234644300246533 |
oct | 667367104325673 |
9 | 127835100255534 |
10 | 30201020001211 |
11 | 96941a94a7264 |
12 | 34791b05aa3b7 |
13 | 13b0c36b7c427 |
14 | 765a46b044c3 |
15 | 3758e7a80ae1 |
hex | 1b77b911abbb |
30201020001211 has 2 divisors, whose sum is σ = 30201020001212. Its totient is φ = 30201020001210.
The previous prime is 30201020001203. The next prime is 30201020001247. The reversal of 30201020001211 is 11210002010203.
It is a weak prime.
It is an emirp because it is prime and its reverse (11210002010203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30201020001211 - 23 = 30201020001203 is a prime.
It is a super-2 number, since 2×302010200012112 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30201020001191 and 30201020001200.
It is not a weakly prime, because it can be changed into another prime (30201020001811) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15100510000605 + 15100510000606.
It is an arithmetic number, because the mean of its divisors is an integer number (15100510000606).
Almost surely, 230201020001211 is an apocalyptic number.
30201020001211 is a deficient number, since it is larger than the sum of its proper divisors (1).
30201020001211 is an equidigital number, since it uses as much as digits as its factorization.
30201020001211 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 30201020001211 its reverse (11210002010203), we get a palindrome (41411022011414).
The spelling of 30201020001211 in words is "thirty trillion, two hundred one billion, twenty million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •