Base | Representation |
---|---|
bin | 101010000011… |
… | …110010100000 |
3 | 202202011020101 |
4 | 222003302200 |
5 | 10310304233 |
6 | 1032152144 |
7 | 162500341 |
oct | 52036240 |
9 | 22664211 |
10 | 11025568 |
11 | 6250744 |
12 | 3838654 |
13 | 2390608 |
14 | 16700c8 |
15 | e7bc7d |
hex | a83ca0 |
11025568 has 36 divisors (see below), whose sum is σ = 22662990. Its totient is φ = 5273856.
The previous prime is 11025563. The next prime is 11025583. The reversal of 11025568 is 86552011.
It can be written as a sum of positive squares in 3 ways, for example, as 10679824 + 345744 = 3268^2 + 588^2 .
It is not an unprimeable number, because it can be changed into a prime (11025563) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 101098 + ... + 101206.
Almost surely, 211025568 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11025568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11331495).
11025568 is an abundant number, since it is smaller than the sum of its proper divisors (11637422).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11025568 is an equidigital number, since it uses as much as digits as its factorization.
11025568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257 (or 140 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 28.
The square root of 11025568 is about 3320.4770741567. The cubic root of 11025568 is about 222.5701870061.
Adding to 11025568 its reverse (86552011), we get a palindrome (97577579).
It can be divided in two parts, 1102 and 5568, that added together give a triangular number (6670 = T115).
The spelling of 11025568 in words is "eleven million, twenty-five thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •