Base | Representation |
---|---|
bin | 10100100001101100… |
… | …11000100011000101 |
3 | 1001110000021121000000 |
4 | 22100312120203011 |
5 | 140032122010041 |
6 | 5021303111513 |
7 | 540042250434 |
oct | 122066304305 |
9 | 31400247000 |
10 | 11020110021 |
11 | 4745623848 |
12 | 2176742599 |
13 | 1068148b7b |
14 | 76782711b |
15 | 447712bb6 |
hex | 290d988c5 |
11020110021 has 28 divisors (see below), whose sum is σ = 16579319148. Its totient is φ = 7321523904.
The previous prime is 11020109993. The next prime is 11020110041. The reversal of 11020110021 is 12001102011.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 10766345121 + 253764900 = 103761^2 + 15930^2 .
It is a de Polignac number, because none of the positive numbers 2k-11020110021 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11020109985 and 11020110012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020110041) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 187801 + ... + 239393.
It is an arithmetic number, because the mean of its divisors is an integer number (592118541).
Almost surely, 211020110021 is an apocalyptic number.
It is an amenable number.
11020110021 is a deficient number, since it is larger than the sum of its proper divisors (5559209127).
11020110021 is an frugal number, since it uses more digits than its factorization.
11020110021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51904 (or 51889 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11020110021 its reverse (12001102011), we get a palindrome (23021212032).
The spelling of 11020110021 in words is "eleven billion, twenty million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •