Base | Representation |
---|---|
bin | 10100100010010011… |
… | …11101100000001000 |
3 | 1001110100221022220202 |
4 | 22101021331200020 |
5 | 140034430221440 |
6 | 5022005111332 |
7 | 540134004014 |
oct | 122111754010 |
9 | 31410838822 |
10 | 11025242120 |
11 | 4748509652 |
12 | 21783b8548 |
13 | 1069224b09 |
14 | 7683a1544 |
15 | 447dc8615 |
hex | 29127d808 |
11025242120 has 32 divisors (see below), whose sum is σ = 24822319320. Its totient is φ = 4407336960.
The previous prime is 11025242117. The next prime is 11025242131. The reversal of 11025242120 is 2124252011.
It can be written as a sum of positive squares in 4 ways, for example, as 10767382756 + 257859364 = 103766^2 + 16058^2 .
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 = 11025242092 and 11025242101.
It is an unprimeable number.
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, 20921 + ... + 149960.
Almost surely, 211025242120 is an apocalyptic number.
11025242120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11025242120 is an abundant number, since it is smaller than the sum of its proper divisors (13797077200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11025242120 is a wasteful number, since it uses less digits than its factorization.
11025242120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172505 (or 172501 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 20.
Adding to 11025242120 its reverse (2124252011), we get a palindrome (13149494131).
The spelling of 11025242120 in words is "eleven billion, twenty-five million, two hundred forty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •