Base | Representation |
---|---|
bin | 100101101111011000000… |
… | …101011100011001100110 |
3 | 100011221020211002101000220 |
4 | 211233120011130121212 |
5 | 314442432042211230 |
6 | 5303233315545210 |
7 | 355242054146241 |
oct | 45573005343146 |
9 | 10157224071026 |
10 | 2593490585190 |
11 | 90a99090671a |
12 | 35a7768bb206 |
13 | 15a74672562b |
14 | 8d7503dc258 |
15 | 476e1639d10 |
hex | 25bd815c666 |
2593490585190 has 32 divisors (see below), whose sum is σ = 6225308425440. Its totient is φ = 691494042624.
The previous prime is 2593490585111. The next prime is 2593490585197. The reversal of 2593490585190 is 915850943952.
2593490585190 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×25934905851902 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2593490585197) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6261409 + ... + 6662748.
It is an arithmetic number, because the mean of its divisors is an integer number (194540888295).
Almost surely, 22593490585190 is an apocalyptic number.
2593490585190 is an abundant number, since it is smaller than the sum of its proper divisors (3631817840250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2593490585190 is a wasteful number, since it uses less digits than its factorization.
2593490585190 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12930856.
The product of its (nonzero) digits is 17496000, while the sum is 60.
The spelling of 2593490585190 in words is "two trillion, five hundred ninety-three billion, four hundred ninety million, five hundred eighty-five thousand, one hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •