Base | Representation |
---|---|
bin | 1101101111010000111011… |
… | …11011111011111001111001 |
3 | 10221222011122121002021001002 |
4 | 12313220131323323321321 |
5 | 12424440221331224233 |
6 | 144130514114534345 |
7 | 6235460142505235 |
oct | 667503573737171 |
9 | 127864577067032 |
10 | 30211302211193 |
11 | 96985a5544864 |
12 | 347b19bb973b5 |
13 | 13b1bb517914c |
14 | 7663405295c5 |
15 | 375cea5d66e8 |
hex | 1b7a1defbe79 |
30211302211193 has 2 divisors, whose sum is σ = 30211302211194. Its totient is φ = 30211302211192.
The previous prime is 30211302211177. The next prime is 30211302211229. The reversal of 30211302211193 is 39111220311203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29073318913024 + 1137983298169 = 5391968^2 + 1066763^2 .
It is a cyclic number.
It is not a de Polignac number, because 30211302211193 - 24 = 30211302211177 is a prime.
It is not a weakly prime, because it can be changed into another prime (30211302211793) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15105651105596 + 15105651105597.
It is an arithmetic number, because the mean of its divisors is an integer number (15105651105597).
Almost surely, 230211302211193 is an apocalyptic number.
It is an amenable number.
30211302211193 is a deficient number, since it is larger than the sum of its proper divisors (1).
30211302211193 is an equidigital number, since it uses as much as digits as its factorization.
30211302211193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 29.
Adding to 30211302211193 its reverse (39111220311203), we get a palindrome (69322522522396).
The spelling of 30211302211193 in words is "thirty trillion, two hundred eleven billion, three hundred two million, two hundred eleven thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •