Base | Representation |
---|---|
bin | 1001101001010100100100… |
… | …01111110000010001111101 |
3 | 2210002202022012120202202112 |
4 | 10310222102033300101331 |
5 | 10240010113020023401 |
6 | 113040111100103405 |
7 | 4316305256102405 |
oct | 464522217602175 |
9 | 83082265522675 |
10 | 21211002111101 |
11 | 68385987a4030 |
12 | 2466a01834b65 |
13 | bab25c084c4a |
14 | 534891a45805 |
15 | 26bb308cb3bb |
hex | 134a923f047d |
21211002111101 has 8 divisors (see below), whose sum is σ = 23139313975008. Its totient is φ = 19282696738000.
The previous prime is 21211002111029. The next prime is 21211002111137. The reversal of 21211002111101 is 10111120011212.
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 21211002111101 - 226 = 21210935002237 is a prime.
It is a super-2 number, since 2×212110021111012 (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 (21211002111301) 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, 7383311 + ... + 9845571.
It is an arithmetic number, because the mean of its divisors is an integer number (2892414246876).
Almost surely, 221211002111101 is an apocalyptic number.
It is an amenable number.
21211002111101 is a deficient number, since it is larger than the sum of its proper divisors (1928311863907).
21211002111101 is a wasteful number, since it uses less digits than its factorization.
21211002111101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3245403.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 21211002111101 its reverse (10111120011212), we get a palindrome (31322122122313).
The spelling of 21211002111101 in words is "twenty-one trillion, two hundred eleven billion, two million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •