Base | Representation |
---|---|
bin | 1001001001010011101010… |
… | …00100100001110000111101 |
3 | 2122012121000020102121021201 |
4 | 10210221311010201300331 |
5 | 10113444312224013041 |
6 | 110434511042455501 |
7 | 4143654231662440 |
oct | 444516504416075 |
9 | 78177006377251 |
10 | 20111001001021 |
11 | 6454033855017 |
12 | 2309791664591 |
13 | b2b5c7cab628 |
14 | 4d754036d657 |
15 | 24d1eecab631 |
hex | 124a75121c3d |
20111001001021 has 16 divisors (see below), whose sum is σ = 23152063536000. Its totient is φ = 17111983099968.
The previous prime is 20111001001001. The next prime is 20111001001027. The reversal of 20111001001021 is 12010010011102.
It is a cyclic number.
It is not a de Polignac number, because 20111001001021 - 213 = 20111000992829 is a prime.
It is a super-2 number, since 2×201110010010212 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20111001000989 and 20111001001007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20111001001027) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7136055 + ... + 9547003.
It is an arithmetic number, because the mean of its divisors is an integer number (1447003971000).
Almost surely, 220111001001021 is an apocalyptic number.
It is an amenable number.
20111001001021 is a deficient number, since it is larger than the sum of its proper divisors (3041062534979).
20111001001021 is a wasteful number, since it uses less digits than its factorization.
20111001001021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2419668.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 20111001001021 its reverse (12010010011102), we get a palindrome (32121011012123).
The spelling of 20111001001021 in words is "twenty trillion, one hundred eleven billion, one million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •