Base | Representation |
---|---|
bin | 10100100010001011… |
… | …01100001010011000 |
3 | 1001110021211110010002 |
4 | 22101011230022120 |
5 | 140034133410040 |
6 | 5021525112132 |
7 | 540121331615 |
oct | 122105541230 |
9 | 31407743102 |
10 | 11024122520 |
11 | 4747914464 |
12 | 2177b58648 |
13 | 1068c22328 |
14 | 76818d50c |
15 | 447c56a15 |
hex | 29116c298 |
11024122520 has 32 divisors (see below), whose sum is σ = 25210908720. Its totient is φ = 4337358720.
The previous prime is 11024122519. The next prime is 11024122523. The reversal of 11024122520 is 2522142011.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 11024122492 and 11024122501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11024122523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2256602 + ... + 2261481.
Almost surely, 211024122520 is an apocalyptic number.
11024122520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11024122520 is an abundant number, since it is smaller than the sum of its proper divisors (14186786200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11024122520 is a wasteful number, since it uses less digits than its factorization.
11024122520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4518155 (or 4518151 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 20.
Adding to 11024122520 its reverse (2522142011), we get a palindrome (13546264531).
The spelling of 11024122520 in words is "eleven billion, twenty-four million, one hundred twenty-two thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •