Base | Representation |
---|---|
bin | 1001100011100000011010… |
… | …01110110110101111111111 |
3 | 2202101122120210110000011011 |
4 | 10301300031032312233333 |
5 | 10223221420203310421 |
6 | 112404225110340051 |
7 | 4266003113212345 |
oct | 461601516665777 |
9 | 82348523400134 |
10 | 21011202010111 |
11 | 6770889856a25 |
12 | 243414105a627 |
13 | b9546a2b6111 |
14 | 528d3a31b995 |
15 | 266839c914e1 |
hex | 131c0d3b6bff |
21011202010111 has 8 divisors (see below), whose sum is σ = 21070787376224. Its totient is φ = 20951700628320.
The previous prime is 21011202010103. The next prime is 21011202010159. The reversal of 21011202010111 is 11101020211012.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21011202010111 - 23 = 21011202010103 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21011202010091 and 21011202010100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21011202013111) 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, 20494995 + ... + 21495748.
It is an arithmetic number, because the mean of its divisors is an integer number (2633848422028).
Almost surely, 221011202010111 is an apocalyptic number.
21011202010111 is a deficient number, since it is larger than the sum of its proper divisors (59585366113).
21011202010111 is an equidigital number, since it uses as much as digits as its factorization.
21011202010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41992161.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 21011202010111 its reverse (11101020211012), we get a palindrome (32112222221123).
The spelling of 21011202010111 in words is "twenty-one trillion, eleven billion, two hundred two million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •