Base | Representation |
---|---|
bin | 11101011011001011000… |
… | …00000100011001110101 |
3 | 10120122121201220121101010 |
4 | 32231211200010121311 |
5 | 113031032134020041 |
6 | 2052242320022433 |
7 | 133021011035250 |
oct | 16554540043165 |
9 | 3518551817333 |
10 | 1011020220021 |
11 | 35a853614349 |
12 | 143b38761a19 |
13 | 744534527a6 |
14 | 36d0dc9c097 |
15 | 1b473e9ba16 |
hex | eb65804675 |
1011020220021 has 16 divisors (see below), whose sum is σ = 1555000395264. Its totient is φ = 572326531824.
The previous prime is 1011020219947. The next prime is 1011020220029. The reversal of 1011020220021 is 1200220201101.
It is not a de Polignac number, because 1011020220021 - 27 = 1011020219893 is a prime.
It is a super-2 number, since 2×10110202200212 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1011020219979 and 1011020220006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011020220029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 224968875 + ... + 224973368.
It is an arithmetic number, because the mean of its divisors is an integer number (97187524704).
Almost surely, 21011020220021 is an apocalyptic number.
It is an amenable number.
1011020220021 is a deficient number, since it is larger than the sum of its proper divisors (543980175243).
1011020220021 is a wasteful number, since it uses less digits than its factorization.
1011020220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 449942360.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1011020220021 its reverse (1200220201101), we get a palindrome (2211240421122).
The spelling of 1011020220021 in words is "one trillion, eleven billion, twenty million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •