Base | Representation |
---|---|
bin | 1001100110011010101100… |
… | …10011000101000111011111 |
3 | 2202202012201200002002000122 |
4 | 10303031112103011013133 |
5 | 10231341230244231421 |
6 | 112522205033545155 |
7 | 4306143342032525 |
oct | 463152623050737 |
9 | 82665650062018 |
10 | 21111212102111 |
11 | 67aa23a95531a |
12 | 244b5b22751bb |
13 | ba1a17c1a251 |
14 | 52db06848315 |
15 | 26923ed212ab |
hex | 1333564c51df |
21111212102111 has 8 divisors (see below), whose sum is σ = 21124660937184. Its totient is φ = 21097767525120.
The previous prime is 21111212102083. The next prime is 21111212102143. The reversal of 21111212102111 is 11120121211112.
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 21111212102111 - 222 = 21111207907807 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 21111212102111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21111212102411) 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, 8884046 + ... + 11006756.
It is an arithmetic number, because the mean of its divisors is an integer number (2640582617148).
Almost surely, 221111212102111 is an apocalyptic number.
21111212102111 is a deficient number, since it is larger than the sum of its proper divisors (13448835073).
21111212102111 is a wasteful number, since it uses less digits than its factorization.
21111212102111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2129041.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 21111212102111 its reverse (11120121211112), we get a palindrome (32231333313223).
The spelling of 21111212102111 in words is "twenty-one trillion, one hundred eleven billion, two hundred twelve million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •