Base | Representation |
---|---|
bin | 11101011101010111110… |
… | …010100011011101010000 |
3 | 21011112100002101121002211 |
4 | 131131113302203131100 |
5 | 231131434012413030 |
6 | 4145555254321504 |
7 | 266154403022461 |
oct | 35352762433520 |
9 | 7145302347084 |
10 | 2024402466640 |
11 | 7105a9464194 |
12 | 288414359294 |
13 | 118b92056948 |
14 | 6dda5732d68 |
15 | 379d54bd12a |
hex | 1d757ca3750 |
2024402466640 has 40 divisors (see below), whose sum is σ = 4752432217728. Its totient is φ = 801899226240.
The previous prime is 2024402466601. The next prime is 2024402466677. The reversal of 2024402466640 is 466642044202.
It is a tau number, because it is divible by the number of its divisors (40).
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 = 2024402466593 and 2024402466602.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 122831716 + ... + 122848195.
Almost surely, 22024402466640 is an apocalyptic number.
2024402466640 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2024402466640 is an abundant number, since it is smaller than the sum of its proper divisors (2728029751088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2024402466640 is a wasteful number, since it uses less digits than its factorization.
2024402466640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245680027 (or 245680021 counting only the distinct ones).
The product of its (nonzero) digits is 442368, while the sum is 40.
The spelling of 2024402466640 in words is "two trillion, twenty-four billion, four hundred two million, four hundred sixty-six thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •