Base | Representation |
---|---|
bin | 1001100011100000001111… |
… | …10111100101000001010101 |
3 | 2202101122100112010010210220 |
4 | 10301300013313211001111 |
5 | 10223221224134201401 |
6 | 112404212133504553 |
7 | 4266000641266545 |
oct | 461600767450125 |
9 | 82348315103726 |
10 | 21011112022101 |
11 | 6770842a83673 |
12 | 2434116aa2159 |
13 | b95454769786 |
14 | 528d2c3b5325 |
15 | 266831e18336 |
hex | 131c07de5055 |
21011112022101 has 8 divisors (see below), whose sum is σ = 28017343802400. Its totient is φ = 14006144128272.
The previous prime is 21011112022079. The next prime is 21011112022133. The reversal of 21011112022101 is 10122021111012.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21011112022101 - 26 = 21011112022037 is a prime.
It is a super-2 number, since 2×210111120221012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21011112022601) 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, 315932826 + ... + 315999323.
It is an arithmetic number, because the mean of its divisors is an integer number (3502167975300).
Almost surely, 221011112022101 is an apocalyptic number.
It is an amenable number.
21011112022101 is a deficient number, since it is larger than the sum of its proper divisors (7006231780299).
21011112022101 is a wasteful number, since it uses less digits than its factorization.
21011112022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 631943235.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 21011112022101 its reverse (10122021111012), we get a palindrome (31133133133113).
The spelling of 21011112022101 in words is "twenty-one trillion, eleven billion, one hundred twelve million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •