Base | Representation |
---|---|
bin | 1001101001101000… |
… | …1010101110101000 |
3 | 20200112120121211120 |
4 | 2122122022232220 |
5 | 20301140112302 |
6 | 1105020255240 |
7 | 121124214453 |
oct | 23232125650 |
9 | 6615517746 |
10 | 2590550952 |
11 | 110a331300 |
12 | 6036a1520 |
13 | 3239150b2 |
14 | 1a80a249a |
15 | 1026659bc |
hex | 9a68aba8 |
2590550952 has 96 divisors (see below), whose sum is σ = 7167636000. Its totient is φ = 779616640.
The previous prime is 2590550951. The next prime is 2590550957.
2590550952 is nontrivially palindromic in base 10.
It is not an unprimeable number, because it can be changed into a prime (2590550951) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 429703 + ... + 435689.
It is an arithmetic number, because the mean of its divisors is an integer number (74662875).
Almost surely, 22590550952 is an apocalyptic number.
2590550952 is a gapful number since it is divisible by the number (22) 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 2590550952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3583818000).
2590550952 is an abundant number, since it is smaller than the sum of its proper divisors (4577085048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2590550952 is a wasteful number, since it uses less digits than its factorization.
2590550952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6167 (or 6152 counting only the distinct ones).
The product of its (nonzero) digits is 202500, while the sum is 42.
The square root of 2590550952 is about 50897.4552605531. The cubic root of 2590550952 is about 1373.4010640447.
The spelling of 2590550952 in words is "two billion, five hundred ninety million, five hundred fifty thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •