Base | Representation |
---|---|
bin | 101001110101100100100… |
… | …110000010001011100000 |
3 | 101011211221010212202111020 |
4 | 221311210212002023200 |
5 | 334101020312004044 |
6 | 10040433305445440 |
7 | 414466460460423 |
oct | 51654446021340 |
9 | 11154833782436 |
10 | 2875020813024 |
11 | a0932032a7a8 |
12 | 3a52467a0880 |
13 | 17b161bc3469 |
14 | 9d21a5899ba |
15 | 4ebbc598a19 |
hex | 29d649822e0 |
2875020813024 has 96 divisors (see below), whose sum is σ = 7944602924160. Its totient is φ = 907848000000.
The previous prime is 2875020813023. The next prime is 2875020813109. The reversal of 2875020813024 is 4203180205782.
It is a tau number, because it is divible by the number of its divisors (96).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2875020813023) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 41006799 + ... + 41076849.
It is an arithmetic number, because the mean of its divisors is an integer number (82756280460).
Almost surely, 22875020813024 is an apocalyptic number.
2875020813024 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
2875020813024 is an abundant number, since it is smaller than the sum of its proper divisors (5069582111136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2875020813024 is a wasteful number, since it uses less digits than its factorization.
2875020813024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92584 (or 92576 counting only the distinct ones).
The product of its (nonzero) digits is 215040, while the sum is 42.
The spelling of 2875020813024 in words is "two trillion, eight hundred seventy-five billion, twenty million, eight hundred thirteen thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •