Base | Representation |
---|---|
bin | 10100100001111011… |
… | …01011000110011101 |
3 | 1001110010212200101210 |
4 | 22100331223012131 |
5 | 140033114133041 |
6 | 5021412055033 |
7 | 540064430034 |
oct | 122075530635 |
9 | 31403780353 |
10 | 11022021021 |
11 | 4746709590 |
12 | 2177304479 |
13 | 106866793b |
14 | 767ba371b |
15 | 44798e016 |
hex | 290f6b19d |
11022021021 has 32 divisors (see below), whose sum is σ = 16585865856. Its totient is φ = 6452480000.
The previous prime is 11022021013. The next prime is 11022021029. The reversal of 11022021021 is 12012022011.
It is an interprime number because it is at equal distance from previous prime (11022021013) and next prime (11022021029).
It is a cyclic number.
It is not a de Polignac number, because 11022021021 - 23 = 11022021013 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11022020988 and 11022021006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11022021029) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 96325 + ... + 176981.
It is an arithmetic number, because the mean of its divisors is an integer number (518308308).
Almost surely, 211022021021 is an apocalyptic number.
11022021021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11022021021 is a deficient number, since it is larger than the sum of its proper divisors (5563844835).
11022021021 is a wasteful number, since it uses less digits than its factorization.
11022021021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80813.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11022021021 its reverse (12012022011), we get a palindrome (23034043032).
The spelling of 11022021021 in words is "eleven billion, twenty-two million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •