Base | Representation |
---|---|
bin | 1001100110011000011110… |
… | …01111111101001111101110 |
3 | 2202202002122121010011001010 |
4 | 10303030033033331033232 |
5 | 10231331310121213402 |
6 | 112521450453130050 |
7 | 4306101656141112 |
oct | 463141717751756 |
9 | 82662577104033 |
10 | 21110020101102 |
11 | 67a9789012319 |
12 | 244b31b029926 |
13 | ba1887c968ca |
14 | 52da323db742 |
15 | 2691c0365a6c |
hex | 13330f3fd3ee |
21110020101102 has 8 divisors (see below), whose sum is σ = 42220040202216. Its totient is φ = 7036673367032.
The previous prime is 21110020101097. The next prime is 21110020101103. The reversal of 21110020101102 is 20110102001112.
It is a sphenic number, since it is the product of 3 distinct primes.
21110020101102 is an admirable number.
It is a super-2 number, since 2×211100201011022 (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 (21110020101103) 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, 1759168341753 + ... + 1759168341764.
It is an arithmetic number, because the mean of its divisors is an integer number (5277505025277).
Almost surely, 221110020101102 is an apocalyptic number.
21110020101102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21110020101102 is a wasteful number, since it uses less digits than its factorization.
21110020101102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3518336683522.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 21110020101102 its reverse (20110102001112), we get a palindrome (41220122102214).
The spelling of 21110020101102 in words is "twenty-one trillion, one hundred ten billion, twenty million, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •