Base | Representation |
---|---|
bin | 100101101100010101001… |
… | …111100100000000000000 |
3 | 100011121211000001211000000 |
4 | 211230111033210000000 |
5 | 314414233222240030 |
6 | 5301533104000000 |
7 | 355065052004256 |
oct | 45542517440000 |
9 | 10147730054000 |
10 | 2590221680640 |
11 | 909563680310 |
12 | 35a004000000 |
13 | 15a34540ca99 |
14 | 8d5201d85d6 |
15 | 4759e67a860 |
hex | 25b153e4000 |
2590221680640 has 840 divisors, whose sum is σ = 10170123945408. Its totient is φ = 627773276160.
The previous prime is 2590221680633. The next prime is 2590221680659. The reversal of 2590221680640 is 460861220952.
2590221680640 is a `hidden beast` number, since 2 + 590 + 2 + 2 + 16 + 8 + 0 + 6 + 40 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 656914509 + ... + 656918451.
Almost surely, 22590221680640 is an apocalyptic number.
2590221680640 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2590221680640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5085061972704).
2590221680640 is an abundant number, since it is smaller than the sum of its proper divisors (7579902264768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2590221680640 is an frugal number, since it uses more digits than its factorization.
2590221680640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4005 (or 3964 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 45.
The spelling of 2590221680640 in words is "two trillion, five hundred ninety billion, two hundred twenty-one million, six hundred eighty thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •