Base | Representation |
---|---|
bin | 1101101111010000111011… |
… | …11011111110000101001111 |
3 | 10221222011122121002201021101 |
4 | 12313220131323332011033 |
5 | 12424440221332020421 |
6 | 144130514115043531 |
7 | 6235460142543235 |
oct | 667503573760517 |
9 | 127864577081241 |
10 | 30211302220111 |
11 | 96985a5550531 |
12 | 347b19bba05a7 |
13 | 13b1bb518021c |
14 | 76634052c955 |
15 | 375cea5d9191 |
hex | 1b7a1defe14f |
30211302220111 has 4 divisors (see below), whose sum is σ = 30344391657432. Its totient is φ = 30078212782792.
The previous prime is 30211302220097. The next prime is 30211302220207. The reversal of 30211302220111 is 11102220311203.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30211302220111 - 221 = 30211300122959 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30211302224111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66544718320 + ... + 66544718773.
It is an arithmetic number, because the mean of its divisors is an integer number (7586097914358).
Almost surely, 230211302220111 is an apocalyptic number.
30211302220111 is a deficient number, since it is larger than the sum of its proper divisors (133089437321).
30211302220111 is a wasteful number, since it uses less digits than its factorization.
30211302220111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133089437320.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 30211302220111 its reverse (11102220311203), we get a palindrome (41313522531314).
The spelling of 30211302220111 in words is "thirty trillion, two hundred eleven billion, three hundred two million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •