Base | Representation |
---|---|
bin | 101010001100… |
… | …110000000000 |
3 | 202211000120210 |
4 | 222030300000 |
5 | 10312443042 |
6 | 1033034120 |
7 | 163012344 |
oct | 52146000 |
9 | 22730523 |
10 | 11062272 |
11 | 6276281 |
12 | 3855940 |
13 | 23a4230 |
14 | 167d624 |
15 | e87a9c |
hex | a8cc00 |
11062272 has 88 divisors (see below), whose sum is σ = 31867696. Its totient is φ = 3391488.
The previous prime is 11062243. The next prime is 11062277. The reversal of 11062272 is 27226011.
It is not an unprimeable number, because it can be changed into a prime (11062277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39798 + ... + 40074.
Almost surely, 211062272 is an apocalyptic number.
11062272 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 11062272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15933848).
11062272 is an abundant number, since it is smaller than the sum of its proper divisors (20805424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11062272 is a wasteful number, since it uses less digits than its factorization.
11062272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313 (or 295 counting only the distinct ones).
The product of its (nonzero) digits is 336, while the sum is 21.
The square root of 11062272 is about 3325.9993986770. Note that the first 3 decimals coincide. The cubic root of 11062272 is about 222.8168913873.
Adding to 11062272 its reverse (27226011), we get a palindrome (38288283).
The spelling of 11062272 in words is "eleven million, sixty-two thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •