Base | Representation |
---|---|
bin | 1101101111010010011100… |
… | …01101011101001000011111 |
3 | 10221222020202001001101111022 |
4 | 12313221032031131020133 |
5 | 12424443401200010421 |
6 | 144131130325514355 |
7 | 6235516205520461 |
oct | 667511615351037 |
9 | 127866661041438 |
10 | 30212112110111 |
11 | 9698980726908 |
12 | 347b3872729bb |
13 | 13b1cb3bb6889 |
14 | 7663b9d10131 |
15 | 375d467667ab |
hex | 1b7a4e35d21f |
30212112110111 has 8 divisors (see below), whose sum is σ = 30302566429200. Its totient is φ = 30121662549888.
The previous prime is 30212112110071. The next prime is 30212112110209. The reversal of 30212112110111 is 11101121121203.
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 30212112110111 - 210 = 30212112109087 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 30212112110111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30212112110611) 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, 11736365 + ... + 14077161.
It is an arithmetic number, because the mean of its divisors is an integer number (3787820803650).
Almost surely, 230212112110111 is an apocalyptic number.
30212112110111 is a deficient number, since it is larger than the sum of its proper divisors (90454319089).
30212112110111 is a wasteful number, since it uses less digits than its factorization.
30212112110111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2379433.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 30212112110111 its reverse (11101121121203), we get a palindrome (41313233231314).
The spelling of 30212112110111 in words is "thirty trillion, two hundred twelve billion, one hundred twelve million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •