Base | Representation |
---|---|
bin | 101011111110… |
… | …111100010000 |
3 | 210200210012001 |
4 | 223332330100 |
5 | 10422430000 |
6 | 1051043344 |
7 | 200001106 |
oct | 53767420 |
9 | 23623161 |
10 | 11530000 |
11 | 6565729 |
12 | 3a40554 |
13 | 25090b1 |
14 | 1761c76 |
15 | 102b46a |
hex | afef10 |
11530000 has 50 divisors (see below), whose sum is σ = 27939494. Its totient is φ = 4608000.
The previous prime is 11529997. The next prime is 11530019. The reversal of 11530000 is 3511.
It can be written as a sum of positive squares in 5 ways, for example, as 2862864 + 8667136 = 1692^2 + 2944^2 .
It is a tau number, because it is divible by the number of its divisors (50).
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 9424 + ... + 10576.
Almost surely, 211530000 is an apocalyptic number.
11530000 is a gapful number since it is divisible by the number (10) 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 11530000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13969747).
11530000 is an abundant number, since it is smaller than the sum of its proper divisors (16409494).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11530000 is an equidigital number, since it uses as much as digits as its factorization.
11530000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1181 (or 1160 counting only the distinct ones).
The product of its (nonzero) digits is 15, while the sum is 10.
The square root of 11530000 is about 3395.5853692699. The cubic root of 11530000 is about 225.9139777557.
Adding to 11530000 its reverse (3511), we get a palindrome (11533511).
The spelling of 11530000 in words is "eleven million, five hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.463 sec. • engine limits •