Base | Representation |
---|---|
bin | 1001100110011100001101… |
… | …01000110101000111011111 |
3 | 2202202021211012010112211222 |
4 | 10303032012220311013133 |
5 | 10231344410404010421 |
6 | 112522421324403555 |
7 | 4306202420344403 |
oct | 463160650650737 |
9 | 82667735115758 |
10 | 21112023110111 |
11 | 67aa61672466a |
12 | 244b7999a65bb |
13 | ba1b16c5573b |
14 | 52db8243b103 |
15 | 26928b11ecab |
hex | 133386a351df |
21112023110111 has 8 divisors (see below), whose sum is σ = 21214024772400. Its totient is φ = 21010100370688.
The previous prime is 21112023110041. The next prime is 21112023110131. The reversal of 21112023110111 is 11101132021112.
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 21112023110111 - 210 = 21112023109087 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 21112023110111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21112023110131) 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, 19194386 + ... + 20264463.
It is an arithmetic number, because the mean of its divisors is an integer number (2651753096550).
Almost surely, 221112023110111 is an apocalyptic number.
21112023110111 is a deficient number, since it is larger than the sum of its proper divisors (102001662289).
21112023110111 is a wasteful number, since it uses less digits than its factorization.
21112023110111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39461433.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 21112023110111 its reverse (11101132021112), we get a palindrome (32213155131223).
The spelling of 21112023110111 in words is "twenty-one trillion, one hundred twelve billion, twenty-three million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •