Base | Representation |
---|---|
bin | 1010000010101000000110… |
… | …1101101111110111100010 |
3 | 1110002102210110110110102020 |
4 | 2200222001231233313202 |
5 | 2421340404001013010 |
6 | 35251452305402310 |
7 | 2216426331236526 |
oct | 240520155576742 |
9 | 43072713413366 |
10 | 11040242204130 |
11 | 357715a9a6557 |
12 | 12a380a939396 |
13 | 621123719769 |
14 | 2a24c9d8dd86 |
15 | 1422ae585470 |
hex | a0a81b6fde2 |
11040242204130 has 64 divisors (see below), whose sum is σ = 26896952309760. Its totient is φ = 2899594931904.
The previous prime is 11040242204129. The next prime is 11040242204177. The reversal of 11040242204130 is 3140224204011.
11040242204130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 11040242204130.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10595577 + ... + 11590803.
It is an arithmetic number, because the mean of its divisors is an integer number (420264879840).
Almost surely, 211040242204130 is an apocalyptic number.
11040242204130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11040242204130 is an abundant number, since it is smaller than the sum of its proper divisors (15856710105630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11040242204130 is a wasteful number, since it uses less digits than its factorization.
11040242204130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1000823.
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 11040242204130 its reverse (3140224204011), we get a palindrome (14180466408141).
The spelling of 11040242204130 in words is "eleven trillion, forty billion, two hundred forty-two million, two hundred four thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •