Base | Representation |
---|---|
bin | 101011101011… |
… | …011100010100 |
3 | 210112201121222 |
4 | 223223130110 |
5 | 10412401012 |
6 | 1045225512 |
7 | 166216211 |
oct | 53533424 |
9 | 23481558 |
10 | 11450132 |
11 | 6510721 |
12 | 3a02298 |
13 | 24ab935 |
14 | 1740b08 |
15 | 1012972 |
hex | aeb714 |
11450132 has 12 divisors (see below), whose sum is σ = 20064660. Its totient is φ = 5717376.
The previous prime is 11450119. The next prime is 11450137. The reversal of 11450132 is 23105411.
It can be written as a sum of positive squares in 2 ways, for example, as 1628176 + 9821956 = 1276^2 + 3134^2 .
It is a super-2 number, since 2×114501322 = 262211045634848, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11450132.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11450137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2618 + ... + 5454.
It is an arithmetic number, because the mean of its divisors is an integer number (1672055).
Almost surely, 211450132 is an apocalyptic number.
It is an amenable number.
11450132 is a deficient number, since it is larger than the sum of its proper divisors (8614528).
11450132 is a wasteful number, since it uses less digits than its factorization.
11450132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3850 (or 3848 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 11450132 is about 3383.8043678676. The cubic root of 11450132 is about 225.3911353024.
Adding to 11450132 its reverse (23105411), we get a palindrome (34555543).
The spelling of 11450132 in words is "eleven million, four hundred fifty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •