Base | Representation |
---|---|
bin | 101000110011000110000… |
… | …001100110100101101000 |
3 | 100221000200120010211201120 |
4 | 220303012001212211220 |
5 | 331413324043022320 |
6 | 5543550324215240 |
7 | 406361560114353 |
oct | 50630601464550 |
9 | 10830616124646 |
10 | 2803640985960 |
11 | 991021278191 |
12 | 39344583a520 |
13 | 1744c79413b9 |
14 | 999a85d329a |
15 | 4cde0c7a440 |
hex | 28cc6066968 |
2803640985960 has 64 divisors (see below), whose sum is σ = 8412863860800. Its totient is φ = 747465071616.
The previous prime is 2803640985913. The next prime is 2803640985997. The reversal of 2803640985960 is 695890463082.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a junction number, because it is equal to n+sod(n) for n = 2803640985894 and 2803640985903.
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, 2173090 + ... + 3213969.
It is an arithmetic number, because the mean of its divisors is an integer number (131450997825).
Almost surely, 22803640985960 is an apocalyptic number.
2803640985960 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2803640985960 is an abundant number, since it is smaller than the sum of its proper divisors (5609222874840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2803640985960 is a wasteful number, since it uses less digits than its factorization.
2803640985960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5391410 (or 5391406 counting only the distinct ones).
The product of its (nonzero) digits is 22394880, while the sum is 60.
The spelling of 2803640985960 in words is "two trillion, eight hundred three billion, six hundred forty million, nine hundred eighty-five thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •