Base | Representation |
---|---|
bin | 10100100010001100… |
… | …11101110101110000 |
3 | 1001110022012210020101 |
4 | 22101012131311300 |
5 | 140034211413000 |
6 | 5021533322144 |
7 | 540123140062 |
oct | 122106356560 |
9 | 31408183211 |
10 | 11024326000 |
11 | 4747a43326 |
12 | 2178036354 |
13 | 1068c93b2c |
14 | 768203732 |
15 | 447c96e6a |
hex | 29119dd70 |
11024326000 has 80 divisors (see below), whose sum is σ = 27307189728. Its totient is φ = 4302144000.
The previous prime is 11024325979. The next prime is 11024326007. The reversal of 11024326000 is 62342011.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11024326007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14779 + ... + 149221.
Almost surely, 211024326000 is an apocalyptic number.
11024326000 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 11024326000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13653594864).
11024326000 is an abundant number, since it is smaller than the sum of its proper divisors (16282863728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11024326000 is a wasteful number, since it uses less digits than its factorization.
11024326000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 134507 (or 134491 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 11024326000 its reverse (62342011), we get a palindrome (11086668011).
The spelling of 11024326000 in words is "eleven billion, twenty-four million, three hundred twenty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •