Base | Representation |
---|---|
bin | 101010011011… |
… | …100001000000 |
3 | 202221002112210 |
4 | 222123201000 |
5 | 10321412002 |
6 | 1034222120 |
7 | 163353564 |
oct | 52334100 |
9 | 22832483 |
10 | 11122752 |
11 | 6307763 |
12 | 3884940 |
13 | 23c5914 |
14 | 16976a4 |
15 | e9a96c |
hex | a9b840 |
11122752 has 56 divisors (see below), whose sum is σ = 30988000. Its totient is φ = 3511296.
The previous prime is 11122729. The next prime is 11122753. The reversal of 11122752 is 25722111.
It is a super-2 number, since 2×111227522 = 247431224107008, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11122753) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2124 + ... + 5172.
Almost surely, 211122752 is an apocalyptic number.
11122752 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11122752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15494000).
11122752 is an abundant number, since it is smaller than the sum of its proper divisors (19865248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11122752 is a wasteful number, since it uses less digits than its factorization.
11122752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3083 (or 3073 counting only the distinct ones).
The product of its digits is 280, while the sum is 21.
The square root of 11122752 is about 3335.0790095588. The cubic root of 11122752 is about 223.2222174413. Note that the first 4 decimals are identical.
Adding to 11122752 its reverse (25722111), we get a palindrome (36844863).
The spelling of 11122752 in words is "eleven million, one hundred twenty-two thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •