Base | Representation |
---|---|
bin | 101010001001… |
… | …110010101000 |
3 | 202210101221220 |
4 | 222021302220 |
5 | 10312101102 |
6 | 1032502040 |
7 | 162632121 |
oct | 52116250 |
9 | 22711856 |
10 | 11050152 |
11 | 6268163 |
12 | 384a920 |
13 | 239b869 |
14 | 1679048 |
15 | e841bc |
hex | a89ca8 |
11050152 has 32 divisors (see below), whose sum is σ = 27732480. Its totient is φ = 3669120.
The previous prime is 11050147. The next prime is 11050177. The reversal of 11050152 is 25105011.
It is a super-3 number, since 3×110501523 (a number of 22 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6777 + ... + 8247.
It is an arithmetic number, because the mean of its divisors is an integer number (866640).
Almost surely, 211050152 is an apocalyptic number.
11050152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11050152 is an abundant number, since it is smaller than the sum of its proper divisors (16682328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11050152 is a wasteful number, since it uses less digits than its factorization.
11050152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1793 (or 1789 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 15.
The square root of 11050152 is about 3324.1768906001. The cubic root of 11050152 is about 222.7354877487.
Adding to 11050152 its reverse (25105011), we get a palindrome (36155163).
The spelling of 11050152 in words is "eleven million, fifty thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •