Base | Representation |
---|---|
bin | 10100100001101101… |
… | …11000110001100100 |
3 | 1001110000112022001212 |
4 | 22100312320301210 |
5 | 140032140221040 |
6 | 5021310010552 |
7 | 540043340324 |
oct | 122066706144 |
9 | 31400468055 |
10 | 11020242020 |
11 | 4745703a37 |
12 | 21767a6a58 |
13 | 1068193c88 |
14 | 76785d284 |
15 | 44773bd65 |
hex | 290db8c64 |
11020242020 has 12 divisors (see below), whose sum is σ = 23142508284. Its totient is φ = 4408096800.
The previous prime is 11020241963. The next prime is 11020242029. The reversal of 11020242020 is 2024202011.
It can be written as a sum of positive squares in 2 ways, for example, as 7566564196 + 3453677824 = 86986^2 + 58768^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11020241986 and 11020242004.
It is not an unprimeable number, because it can be changed into a prime (11020242029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 275506031 + ... + 275506070.
It is an arithmetic number, because the mean of its divisors is an integer number (1928542357).
Almost surely, 211020242020 is an apocalyptic number.
11020242020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11020242020 is an abundant number, since it is smaller than the sum of its proper divisors (12122266264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020242020 is a wasteful number, since it uses less digits than its factorization.
11020242020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 551012110 (or 551012108 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 11020242020 its reverse (2024202011), we get a palindrome (13044444031).
The spelling of 11020242020 in words is "eleven billion, twenty million, two hundred forty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •