Base | Representation |
---|---|
bin | 10100110000000000… |
… | …00111111101101000 |
3 | 1001202101001220211221 |
4 | 22120000013331220 |
5 | 140303331312130 |
6 | 5041231031424 |
7 | 543030215302 |
oct | 123000077550 |
9 | 31671056757 |
10 | 11140104040 |
11 | 47a733105a |
12 | 21aa96b574 |
13 | 1086c70150 |
14 | 779740972 |
15 | 45301687a |
hex | 298007f68 |
11140104040 has 64 divisors (see below), whose sum is σ = 27025079760. Its totient is φ = 4108431360.
The previous prime is 11140104037. The next prime is 11140104047. The reversal of 11140104040 is 4040104111.
It can be written as a sum of positive squares in 8 ways, for example, as 1985058916 + 9155045124 = 44554^2 + 95682^2 .
It is not an unprimeable number, because it can be changed into a prime (11140104047) 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, 445962 + ... + 470278.
Almost surely, 211140104040 is an apocalyptic number.
11140104040 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 11140104040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13512539880).
11140104040 is an abundant number, since it is smaller than the sum of its proper divisors (15884975720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11140104040 is a wasteful number, since it uses less digits than its factorization.
11140104040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25222 (or 25218 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 11140104040 its reverse (4040104111), we get a palindrome (15180208151).
The spelling of 11140104040 in words is "eleven billion, one hundred forty million, one hundred four thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •