Base | Representation |
---|---|
bin | 10100011111101010… |
… | …01111000111000000 |
3 | 1001101211010221100201 |
4 | 22033311033013000 |
5 | 140013234011000 |
6 | 5015453054544 |
7 | 536444141332 |
oct | 121765170700 |
9 | 31354127321 |
10 | 11003032000 |
11 | 4736a19884 |
12 | 2170a87454 |
13 | 106474972c |
14 | 76545d452 |
15 | 445e8c96a |
hex | 28fd4f1c0 |
11003032000 has 56 divisors (see below), whose sum is σ = 27249028560. Its totient is φ = 4401209600.
The previous prime is 11003031989. The next prime is 11003032003. The reversal of 11003032000 is 23030011.
11003032000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11003032003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 679690 + ... + 695689.
Almost surely, 211003032000 is an apocalyptic number.
11003032000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11003032000 is an abundant number, since it is smaller than the sum of its proper divisors (16245996560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11003032000 is an equidigital number, since it uses as much as digits as its factorization.
11003032000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1375406 (or 1375386 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 10.
Adding to 11003032000 its reverse (23030011), we get a palindrome (11026062011).
The spelling of 11003032000 in words is "eleven billion, three million, thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •