Base | Representation |
---|---|
bin | 10100101111111111… |
… | …01110111000101000 |
3 | 1001202100212200221111 |
4 | 22113333232320220 |
5 | 140303320020240 |
6 | 5041224520104 |
7 | 543026306650 |
oct | 122777567050 |
9 | 31670780844 |
10 | 11140001320 |
11 | 47a7270968 |
12 | 21aa920034 |
13 | 1086c35476 |
14 | 779715360 |
15 | 452ee61ea |
hex | 297feee28 |
11140001320 has 64 divisors (see below), whose sum is σ = 28736311680. Its totient is φ = 3807350016.
The previous prime is 11140001291. The next prime is 11140001339. The reversal of 11140001320 is 2310004111.
It is a self number, because there is not a number n which added to its sum of digits gives 11140001320.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26007 + ... + 151513.
It is an arithmetic number, because the mean of its divisors is an integer number (449004870).
Almost surely, 211140001320 is an apocalyptic number.
11140001320 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 11140001320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14368155840).
11140001320 is an abundant number, since it is smaller than the sum of its proper divisors (17596310360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11140001320 is a wasteful number, since it uses less digits than its factorization.
11140001320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125842 (or 125838 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 11140001320 its reverse (2310004111), we get a palindrome (13450005431).
The spelling of 11140001320 in words is "eleven billion, one hundred forty million, one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •