Base | Representation |
---|---|
bin | 10100011111101010… |
… | …01000000101100000 |
3 | 1001101211002110220020 |
4 | 22033311020011200 |
5 | 140013232100412 |
6 | 5015452313440 |
7 | 536443661424 |
oct | 121765100540 |
9 | 31354073806 |
10 | 11003003232 |
11 | 47369aa201 |
12 | 2170a72880 |
13 | 1064739600 |
14 | 765452b84 |
15 | 445e8418c |
hex | 28fd48160 |
11003003232 has 144 divisors (see below), whose sum is σ = 31656235968. Its totient is φ = 3344340480.
The previous prime is 11003003201. The next prime is 11003003233. The reversal of 11003003232 is 23230030011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11003003233) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1342507 + ... + 1350677.
It is an arithmetic number, because the mean of its divisors is an integer number (219834972).
Almost surely, 211003003232 is an apocalyptic number.
11003003232 is a gapful number since it is divisible by the number (12) 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 11003003232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15828117984).
11003003232 is an abundant number, since it is smaller than the sum of its proper divisors (20653232736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11003003232 is a wasteful number, since it uses less digits than its factorization.
11003003232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8293 (or 8272 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 11003003232 its reverse (23230030011), we get a palindrome (34233033243).
The spelling of 11003003232 in words is "eleven billion, three million, three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •