Base | Representation |
---|---|
bin | 101010000100… |
… | …010111110000 |
3 | 202202021111200 |
4 | 222010113300 |
5 | 10310343302 |
6 | 1032211200 |
7 | 162510315 |
oct | 52042760 |
9 | 22667450 |
10 | 11027952 |
11 | 6252511 |
12 | 3839b00 |
13 | 2391720 |
14 | 1670d0c |
15 | e7c81c |
hex | a845f0 |
11027952 has 120 divisors (see below), whose sum is σ = 34258224. Its totient is φ = 3290112.
The previous prime is 11027921. The next prime is 11027957. The reversal of 11027952 is 25972011.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11027957) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 80428 + ... + 80564.
Almost surely, 211027952 is an apocalyptic number.
11027952 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 11027952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17129112).
11027952 is an abundant number, since it is smaller than the sum of its proper divisors (23230272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11027952 is a wasteful number, since it uses less digits than its factorization.
11027952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 207 (or 198 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
The square root of 11027952 is about 3320.8360393130. The cubic root of 11027952 is about 222.5862275731.
Adding to 11027952 its reverse (25972011), we get a palindrome (36999963).
The spelling of 11027952 in words is "eleven million, twenty-seven thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •