Base | Representation |
---|---|
bin | 1001100011011110010111… |
… | …01010101110111111011111 |
3 | 2202101112202010121211021212 |
4 | 10301233023222232333133 |
5 | 10223212142104201421 |
6 | 112403524014015035 |
7 | 4265633625366266 |
oct | 461571352567737 |
9 | 82345663554255 |
10 | 21010102022111 |
11 | 677037494a734 |
12 | 2433a947a747b |
13 | b9532343aa47 |
14 | 528c741c35dd |
15 | 2667c340de5b |
hex | 131bcbaaefdf |
21010102022111 has 8 divisors (see below), whose sum is σ = 22120819255920. Its totient is φ = 19899877027392.
The previous prime is 21010102022101. The next prime is 21010102022171. The reversal of 21010102022111 is 11122020101012.
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 21010102022111 - 230 = 21009028280287 is a prime.
It is a super-2 number, since 2×210101020221112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21010102022101) 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, 122972150 + ... + 123142883.
It is an arithmetic number, because the mean of its divisors is an integer number (2765102406990).
Almost surely, 221010102022111 is an apocalyptic number.
21010102022111 is a deficient number, since it is larger than the sum of its proper divisors (1110717233809).
21010102022111 is a wasteful number, since it uses less digits than its factorization.
21010102022111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 246119545.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 21010102022111 its reverse (11122020101012), we get a palindrome (32132122123123).
The spelling of 21010102022111 in words is "twenty-one trillion, ten billion, one hundred two million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •