Base | Representation |
---|---|
bin | 1001110111110101… |
… | …1001001011011001 |
3 | 20211200122212212000 |
4 | 2131331121023121 |
5 | 20411412214300 |
6 | 1114545111213 |
7 | 122446423056 |
oct | 23575311331 |
9 | 6750585760 |
10 | 2650116825 |
11 | 113aa15aa4 |
12 | 61b628509 |
13 | 33306c585 |
14 | 1b1d6a02d |
15 | 1079cec00 |
hex | 9df592d9 |
2650116825 has 96 divisors (see below), whose sum is σ = 5191096320. Its totient is φ = 1320883200.
The previous prime is 2650116817. The next prime is 2650116839. The reversal of 2650116825 is 5286110562.
It is not a de Polignac number, because 2650116825 - 23 = 2650116817 is a prime.
It is a super-2 number, since 2×26501168252 = 14046238372296161250, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2650116825.
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 95 ways as a sum of consecutive naturals, for example, 1800840 + ... + 1802310.
It is an arithmetic number, because the mean of its divisors is an integer number (54073920).
Almost surely, 22650116825 is an apocalyptic number.
2650116825 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2650116825 is a deficient number, since it is larger than the sum of its proper divisors (2540979495).
2650116825 is a wasteful number, since it uses less digits than its factorization.
2650116825 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1664 (or 1653 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 36.
The square root of 2650116825 is about 51479.2853971381. The cubic root of 2650116825 is about 1383.8478386473.
The spelling of 2650116825 in words is "two billion, six hundred fifty million, one hundred sixteen thousand, eight hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •