Base | Representation |
---|---|
bin | 1001100110011000011100… |
… | …00111100001010000100101 |
3 | 2202202002121021101102000210 |
4 | 10303030032013201100211 |
5 | 10231331240241041401 |
6 | 112521444534130033 |
7 | 4306101335552436 |
oct | 463141607412045 |
9 | 82662537342023 |
10 | 21110001112101 |
11 | 67a9779322630 |
12 | 244b3147b0919 |
13 | ba1884078705 |
14 | 52da2da9748d |
15 | 2691bd8644d6 |
hex | 13330e1e1425 |
21110001112101 has 32 divisors (see below), whose sum is σ = 31042569591936. Its totient is φ = 12653746560000.
The previous prime is 21110001112093. The next prime is 21110001112127. The reversal of 21110001112101 is 10121110001112.
It is not a de Polignac number, because 21110001112101 - 23 = 21110001112093 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21110001912101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 256720 + ... + 6502761.
It is an arithmetic number, because the mean of its divisors is an integer number (970080299748).
Almost surely, 221110001112101 is an apocalyptic number.
It is an amenable number.
21110001112101 is a deficient number, since it is larger than the sum of its proper divisors (9932568479835).
21110001112101 is a wasteful number, since it uses less digits than its factorization.
21110001112101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6760533.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 21110001112101 its reverse (10121110001112), we get a palindrome (31231111113213).
It can be divided in two parts, 21110001112 and 101, that multiplied together give a palindrome (2132110112312).
The spelling of 21110001112101 in words is "twenty-one trillion, one hundred ten billion, one million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •