Base | Representation |
---|---|
bin | 100101110111010110111… |
… | …110110100000110100000 |
3 | 100012202101011201121001112 |
4 | 211313112332310012200 |
5 | 320113010333122030 |
6 | 5311212031122452 |
7 | 355664344051310 |
oct | 45672676640640 |
9 | 10182334647045 |
10 | 2602062004640 |
11 | 91358a190a4a |
12 | 360369373428 |
13 | 15b4b1468467 |
14 | 8dd2492d440 |
15 | 47a43da9a95 |
hex | 25dd6fb41a0 |
2602062004640 has 48 divisors (see below), whose sum is σ = 7025567415552. Its totient is φ = 892135544064.
The previous prime is 2602062004541. The next prime is 2602062004657. The reversal of 2602062004640 is 464002602062.
It is a super-2 number, since 2×26020620046402 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a junction number, because it is equal to n+sod(n) for n = 2602062004597 and 2602062004606.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1161633704 + ... + 1161635943.
It is an arithmetic number, because the mean of its divisors is an integer number (146365987824).
Almost surely, 22602062004640 is an apocalyptic number.
2602062004640 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2602062004640 is an abundant number, since it is smaller than the sum of its proper divisors (4423505410912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2602062004640 is a wasteful number, since it uses less digits than its factorization.
2602062004640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2323269669 (or 2323269661 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 32.
The spelling of 2602062004640 in words is "two trillion, six hundred two billion, sixty-two million, four thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •