Base | Representation |
---|---|
bin | 10100100011111100… |
… | …11100100100000000 |
3 | 1001111022211100022200 |
4 | 22101332130210000 |
5 | 140101441011312 |
6 | 5023220033200 |
7 | 540361646616 |
oct | 122176344400 |
9 | 31438740280 |
10 | 11039000832 |
11 | 4755256792 |
12 | 2180b32800 |
13 | 106c031472 |
14 | 76a1436b6 |
15 | 4491e50dc |
hex | 291f9c900 |
11039000832 has 108 divisors (see below), whose sum is σ = 31962927360. Its totient is φ = 3664088064.
The previous prime is 11039000803. The next prime is 11039000839. The reversal of 11039000832 is 23800093011.
It is a junction number, because it is equal to n+sod(n) for n = 11039000796 and 11039000805.
It is not an unprimeable number, because it can be changed into a prime (11039000839) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 540633 + ... + 560679.
Almost surely, 211039000832 is an apocalyptic number.
11039000832 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 11039000832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15981463680).
11039000832 is an abundant number, since it is smaller than the sum of its proper divisors (20923926528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11039000832 is a wasteful number, since it uses less digits than its factorization.
11039000832 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20308 (or 20291 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
Adding to 11039000832 its reverse (23800093011), we get a palindrome (34839093843).
The spelling of 11039000832 in words is "eleven billion, thirty-nine million, eight hundred thirty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •