Base | Representation |
---|---|
bin | 1001101001010010111010… |
… | …01100101101010100101111 |
3 | 2210002200000011220112122021 |
4 | 10310221131030231110233 |
5 | 10240001302200320421 |
6 | 113035442504331011 |
7 | 4316244231231445 |
oct | 464513514552457 |
9 | 83080004815567 |
10 | 21210112120111 |
11 | 6838181388692 |
12 | 24667b3773a67 |
13 | bab149884265 |
14 | 534809772b95 |
15 | 26bacc6ca341 |
hex | 134a5d32d52f |
21210112120111 has 4 divisors (see below), whose sum is σ = 21247388240400. Its totient is φ = 21172835999824.
The previous prime is 21210112120069. The next prime is 21210112120117. The reversal of 21210112120111 is 11102121101212.
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 21210112120111 - 219 = 21210111595823 is a prime.
It is a super-2 number, since 2×212101121201112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21210112120117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18638059291 + ... + 18638060428.
It is an arithmetic number, because the mean of its divisors is an integer number (5311847060100).
Almost surely, 221210112120111 is an apocalyptic number.
21210112120111 is a deficient number, since it is larger than the sum of its proper divisors (37276120289).
21210112120111 is an equidigital number, since it uses as much as digits as its factorization.
21210112120111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37276120288.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 21210112120111 its reverse (11102121101212), we get a palindrome (32312233221323).
The spelling of 21210112120111 in words is "twenty-one trillion, two hundred ten billion, one hundred twelve million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •