Base | Representation |
---|---|
bin | 1001100000011101… |
… | …0010100000001001 |
3 | 20120212010110012102 |
4 | 2120013102200021 |
5 | 20211311011000 |
6 | 1101123123145 |
7 | 120146022041 |
oct | 23007224011 |
9 | 6525113172 |
10 | 2552047625 |
11 | 109a623176 |
12 | 5b28134b5 |
13 | 31895386a |
14 | 1a2d1c721 |
15 | ee0ac3d5 |
hex | 981d2809 |
2552047625 has 8 divisors (see below), whose sum is σ = 3184955592. Its totient is φ = 2041638000.
The previous prime is 2552047613. The next prime is 2552047711. The reversal of 2552047625 is 5267402552.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 252269689 + 2299777936 = 15883^2 + 47956^2 .
It is not a de Polignac number, because 2552047625 - 24 = 2552047609 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10208066 + ... + 10208315.
It is an arithmetic number, because the mean of its divisors is an integer number (398119449).
Almost surely, 22552047625 is an apocalyptic number.
2552047625 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2552047625 is a deficient number, since it is larger than the sum of its proper divisors (632907967).
2552047625 is an equidigital number, since it uses as much as digits as its factorization.
2552047625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20416396 (or 20416386 counting only the distinct ones).
The product of its (nonzero) digits is 168000, while the sum is 38.
The square root of 2552047625 is about 50517.7951320126. The cubic root of 2552047625 is about 1366.5627911994.
The spelling of 2552047625 in words is "two billion, five hundred fifty-two million, forty-seven thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •