Base | Representation |
---|---|
bin | 10100100100000000… |
… | …00001101001100000 |
3 | 1001111100121101021210 |
4 | 22102000001221200 |
5 | 140102042234010 |
6 | 5023232550120 |
7 | 540365323014 |
oct | 122200015140 |
9 | 31440541253 |
10 | 11039414880 |
11 | 475550987a |
12 | 21810b2340 |
13 | 106c147a70 |
14 | 76a210544 |
15 | 449277b20 |
hex | 292001a60 |
11039414880 has 192 divisors, whose sum is σ = 39077821440. Its totient is φ = 2599213056.
The previous prime is 11039414819. The next prime is 11039414887. The reversal of 11039414880 is 8841493011.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11039414887) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 105061 + ... + 181979.
It is an arithmetic number, because the mean of its divisors is an integer number (203530320).
Almost surely, 211039414880 is an apocalyptic number.
11039414880 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 11039414880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19538910720).
11039414880 is an abundant number, since it is smaller than the sum of its proper divisors (28038406560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11039414880 is a wasteful number, since it uses less digits than its factorization.
11039414880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76973 (or 76965 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 39.
The spelling of 11039414880 in words is "eleven billion, thirty-nine million, four hundred fourteen thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •