Base | Representation |
---|---|
bin | 1001101001010100100101… |
… | …01110010001011000101101 |
3 | 2210002202022202122012120212 |
4 | 10310222102232101120231 |
5 | 10240010122042023041 |
6 | 113040111543352205 |
7 | 4316305414101653 |
oct | 464522256213055 |
9 | 83082282565525 |
10 | 21211010111021 |
11 | 68385a2268535 |
12 | 2466a04452665 |
13 | bab260926323 |
14 | 534892b28dd3 |
15 | 26bb3145b8eb |
hex | 134a92b9162d |
21211010111021 has 8 divisors (see below), whose sum is σ = 21786960939744. Its totient is φ = 20642687770320.
The previous prime is 21211010110957. The next prime is 21211010111059. The reversal of 21211010111021 is 12011101011212.
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 21211010111021 - 26 = 21211010110957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21211010110987 and 21211010111005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21211010141021) 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, 1907116370 + ... + 1907127491.
It is an arithmetic number, because the mean of its divisors is an integer number (2723370117468).
Almost surely, 221211010111021 is an apocalyptic number.
It is an amenable number.
21211010111021 is a deficient number, since it is larger than the sum of its proper divisors (575950828723).
21211010111021 is an equidigital number, since it uses as much as digits as its factorization.
21211010111021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3814244011.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 21211010111021 its reverse (12011101011212), we get a palindrome (33222111122233).
The spelling of 21211010111021 in words is "twenty-one trillion, two hundred eleven billion, ten million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •