Base | Representation |
---|---|
bin | 11110001011110000110… |
… | …000110100101010000000 |
3 | 21100021220111202200021120 |
4 | 132023300300310222000 |
5 | 232440442133121404 |
6 | 4224514111152240 |
7 | 302566642262640 |
oct | 36136060645200 |
9 | 7307814680246 |
10 | 2074213567104 |
11 | 72a73a536218 |
12 | 295bb5b15680 |
13 | 12079c927aa3 |
14 | 7256cd30520 |
15 | 38e4d49c9d9 |
hex | 1e2f0c34a80 |
2074213567104 has 128 divisors (see below), whose sum is σ = 6335351278080. Its totient is φ = 588996541440.
The previous prime is 2074213567079. The next prime is 2074213567177. The reversal of 2074213567104 is 4017653124702.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (42).
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 15 ways as a sum of consecutive naturals, for example, 1928902 + ... + 2805189.
It is an arithmetic number, because the mean of its divisors is an integer number (49494931860).
Almost surely, 22074213567104 is an apocalyptic number.
2074213567104 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
2074213567104 is an abundant number, since it is smaller than the sum of its proper divisors (4261137710976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2074213567104 is a wasteful number, since it uses less digits than its factorization.
2074213567104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4734278 (or 4734266 counting only the distinct ones).
The product of its (nonzero) digits is 282240, while the sum is 42.
The spelling of 2074213567104 in words is "two trillion, seventy-four billion, two hundred thirteen million, five hundred sixty-seven thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •