Base | Representation |
---|---|
bin | 1001100011111000… |
… | …1110110111011010 |
3 | 20121212020012102210 |
4 | 2120332032313122 |
5 | 20224002410100 |
6 | 1102355535550 |
7 | 120412320261 |
oct | 23076166732 |
9 | 6555205383 |
10 | 2566450650 |
11 | 10a77703a5 |
12 | 5b75ba5b6 |
13 | 31b92756a |
14 | 1a4bcb5d8 |
15 | 1004a4c50 |
hex | 98f8edda |
2566450650 has 96 divisors (see below), whose sum is σ = 6730997760. Its totient is φ = 645347520.
The previous prime is 2566450639. The next prime is 2566450697. The reversal of 2566450650 is 560546652.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 2566450599 and 2566450608.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 644967 + ... + 648933.
It is an arithmetic number, because the mean of its divisors is an integer number (70114560).
Almost surely, 22566450650 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2566450650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3365498880).
2566450650 is an abundant number, since it is smaller than the sum of its proper divisors (4164547110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2566450650 is a wasteful number, since it uses less digits than its factorization.
2566450650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4228 (or 4223 counting only the distinct ones).
The product of its (nonzero) digits is 216000, while the sum is 39.
The square root of 2566450650 is about 50660.1485390637. The cubic root of 2566450650 is about 1369.1287994762.
The spelling of 2566450650 in words is "two billion, five hundred sixty-six million, four hundred fifty thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •