Base | Representation |
---|---|
bin | 1001100011110100100010… |
… | …11100000110110111011101 |
3 | 2202102200111000121100021010 |
4 | 10301322101130012313131 |
5 | 10223411034030323401 |
6 | 112413213355325433 |
7 | 4266535001543331 |
oct | 461722134066735 |
9 | 82380430540233 |
10 | 21022010011101 |
11 | 6775425677050 |
12 | 2436258750879 |
13 | b964a04c8188 |
14 | 5296838cd7c1 |
15 | 266c6da56ed6 |
hex | 131e91706ddd |
21022010011101 has 8 divisors (see below), whose sum is σ = 30577469107104. Its totient is φ = 12740612127920.
The previous prime is 21022010011091. The next prime is 21022010011103. The reversal of 21022010011101 is 10111001022012.
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 21022010011101 - 25 = 21022010011069 is a prime.
It is a super-2 number, since 2×210220100111012 (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 (21022010011103) 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, 318515303166 + ... + 318515303231.
It is an arithmetic number, because the mean of its divisors is an integer number (3822183638388).
Almost surely, 221022010011101 is an apocalyptic number.
It is an amenable number.
21022010011101 is a deficient number, since it is larger than the sum of its proper divisors (9555459096003).
21022010011101 is a wasteful number, since it uses less digits than its factorization.
21022010011101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 637030606411.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 21022010011101 its reverse (10111001022012), we get a palindrome (31133011033113).
The spelling of 21022010011101 in words is "twenty-one trillion, twenty-two billion, ten million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •