Base | Representation |
---|---|
bin | 1001100110011000101010… |
… | …10101000011110101010101 |
3 | 2202202002220201001100002220 |
4 | 10303030111111003311111 |
5 | 10231332012224231401 |
6 | 112521504535252553 |
7 | 4306104335136114 |
oct | 463142525036525 |
9 | 82662821040086 |
10 | 21110122102101 |
11 | 67a983065016a |
12 | 244b34921a159 |
13 | ba18a315b126 |
14 | 52da41b8dc7b |
15 | 2691c92b3336 |
hex | 133315543d55 |
21110122102101 has 8 divisors (see below), whose sum is σ = 28153740074880. Its totient is φ = 14069959432032.
The previous prime is 21110122102067. The next prime is 21110122102169. The reversal of 21110122102101 is 10120122101112.
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 21110122102101 - 26 = 21110122102037 is a prime.
It is a super-2 number, since 2×211101221021012 (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 (21110122102301) 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, 863811421 + ... + 863835858.
It is an arithmetic number, because the mean of its divisors is an integer number (3519217509360).
Almost surely, 221110122102101 is an apocalyptic number.
It is an amenable number.
21110122102101 is a deficient number, since it is larger than the sum of its proper divisors (7043617972779).
21110122102101 is a wasteful number, since it uses less digits than its factorization.
21110122102101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1727651355.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 21110122102101 its reverse (10120122101112), we get a palindrome (31230244203213).
The spelling of 21110122102101 in words is "twenty-one trillion, one hundred ten billion, one hundred twenty-two million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •