Base | Representation |
---|---|
bin | 100011100000011101101… |
… | …110110101111111000100 |
3 | 22122021011121012022200001 |
4 | 203200131232311333010 |
5 | 304434200300240030 |
6 | 5104534454331044 |
7 | 341200320566563 |
oct | 43403556657704 |
9 | 8567147168601 |
10 | 2440040243140 |
11 | 8608a7118515 |
12 | 334a90659a84 |
13 | 1491303a5376 |
14 | 861546d7bda |
15 | 4370ebabcca |
hex | 2381dbb5fc4 |
2440040243140 has 48 divisors (see below), whose sum is σ = 5155382518272. Its totient is φ = 970055968896.
The previous prime is 2440040243117. The next prime is 2440040243209. The reversal of 2440040243140 is 413420400442.
It is a junction number, because it is equal to n+sod(n) for n = 2440040243099 and 2440040243108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31347109 + ... + 31424851.
It is an arithmetic number, because the mean of its divisors is an integer number (107403802464).
Almost surely, 22440040243140 is an apocalyptic number.
2440040243140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2440040243140 is an abundant number, since it is smaller than the sum of its proper divisors (2715342275132).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2440040243140 is a wasteful number, since it uses less digits than its factorization.
2440040243140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87316 (or 87314 counting only the distinct ones).
The product of its (nonzero) digits is 12288, while the sum is 28.
Adding to 2440040243140 its reverse (413420400442), we get a palindrome (2853460643582).
The spelling of 2440040243140 in words is "two trillion, four hundred forty billion, forty million, two hundred forty-three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.144 sec. • engine limits •