Base | Representation |
---|---|
bin | 1101101100010110010100… |
… | …01000101100100001011111 |
3 | 10221121121001011120022102022 |
4 | 12312023022020230201133 |
5 | 12421320024134201421 |
6 | 144012504235250355 |
7 | 6225312266113511 |
oct | 666131210544137 |
9 | 127547034508368 |
10 | 30111112022111 |
11 | 965a0618178aa |
12 | 346389a5a99bb |
13 | 13a5609138bb3 |
14 | 76155811bbb1 |
15 | 3733d482e7ab |
hex | 1b62ca22c85f |
30111112022111 has 8 divisors (see below), whose sum is σ = 31149534376800. Its totient is φ = 29072696877280.
The previous prime is 30111112022093. The next prime is 30111112022137. The reversal of 30111112022111 is 11122021111103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30111112022111 - 214 = 30111112005727 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30111112022111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30111112022161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7509845 + ... + 10799073.
It is an arithmetic number, because the mean of its divisors is an integer number (3893691797100).
Almost surely, 230111112022111 is an apocalyptic number.
30111112022111 is a deficient number, since it is larger than the sum of its proper divisors (1038422354689).
30111112022111 is a wasteful number, since it uses less digits than its factorization.
30111112022111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3604929.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 30111112022111 its reverse (11122021111103), we get a palindrome (41233133133214).
The spelling of 30111112022111 in words is "thirty trillion, one hundred eleven billion, one hundred twelve million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •