Base | Representation |
---|---|
bin | 101010100010… |
… | …100001011010 |
3 | 202222112220200 |
4 | 222202201122 |
5 | 10323321300 |
6 | 1035003030 |
7 | 163533342 |
oct | 52424132 |
9 | 22875820 |
10 | 11151450 |
11 | 6327282 |
12 | 3899476 |
13 | 24059bb |
14 | 16a3d22 |
15 | ea4200 |
hex | aa285a |
11151450 has 36 divisors (see below), whose sum is σ = 29961438. Its totient is φ = 2973600.
The previous prime is 11151449. The next prime is 11151451. The reversal of 11151450 is 5415111.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (11151449) and next prime (11151451).
It can be written as a sum of positive squares in 3 ways, for example, as 7568001 + 3583449 = 2751^2 + 1893^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is a nialpdrome in base 15.
It is not an unprimeable number, because it can be changed into a prime (11151451) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 11941 + ... + 12840.
Almost surely, 211151450 is an apocalyptic number.
11151450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11151450 is an abundant number, since it is smaller than the sum of its proper divisors (18809988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11151450 is a wasteful number, since it uses less digits than its factorization.
11151450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24799 (or 24791 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 18.
The square root of 11151450 is about 3339.3786847256. The cubic root of 11151450 is about 223.4140323699.
Adding to 11151450 its reverse (5415111), we get a palindrome (16566561).
The spelling of 11151450 in words is "eleven million, one hundred fifty-one thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •