Base | Representation |
---|---|
bin | 101001010101010111000… |
… | …000001110101100100000 |
3 | 101001112122122220212222011 |
4 | 221111113000032230200 |
5 | 333014201330420030 |
6 | 10012513230122304 |
7 | 412133402436250 |
oct | 51252700165440 |
9 | 11045578825864 |
10 | 2840433060640 |
11 | 9a569145a47a |
12 | 39a5b3350394 |
13 | 177b0c20b9a6 |
14 | 9b698b11960 |
15 | 4dd45ceab2a |
hex | 2955700eb20 |
2840433060640 has 48 divisors (see below), whose sum is σ = 7669169266752. Its totient is φ = 973862763264.
The previous prime is 2840433060607. The next prime is 2840433060691. The reversal of 2840433060640 is 460603340482.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 2840433060593 and 2840433060602.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1268049354 + ... + 1268051593.
It is an arithmetic number, because the mean of its divisors is an integer number (159774359724).
Almost surely, 22840433060640 is an apocalyptic number.
2840433060640 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2840433060640 is an abundant number, since it is smaller than the sum of its proper divisors (4828736206112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2840433060640 is a wasteful number, since it uses less digits than its factorization.
2840433060640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2536100969 (or 2536100961 counting only the distinct ones).
The product of its (nonzero) digits is 331776, while the sum is 40.
The spelling of 2840433060640 in words is "two trillion, eight hundred forty billion, four hundred thirty-three million, sixty thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •