Base | Representation |
---|---|
bin | 1001011011011100… |
… | …0000011010101001 |
3 | 20112101112020001202 |
4 | 2112313000122221 |
5 | 20140414031100 |
6 | 1055052053545 |
7 | 116502106436 |
oct | 22667003251 |
9 | 6471466052 |
10 | 2531002025 |
11 | 1089759312 |
12 | 5a77642b5 |
13 | 314495546 |
14 | 1a0200b8d |
15 | ec3017d5 |
hex | 96dc06a9 |
2531002025 has 12 divisors (see below), whose sum is σ = 3173708700. Its totient is φ = 2002049280.
The previous prime is 2531002013. The next prime is 2531002069. The reversal of 2531002025 is 5202001352.
It can be written as a sum of positive squares in 6 ways, for example, as 488233216 + 2042768809 = 22096^2 + 45197^2 .
It is not a de Polignac number, because 2531002025 - 214 = 2530985641 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2531001988 and 2531002006.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 566540 + ... + 570989.
It is an arithmetic number, because the mean of its divisors is an integer number (264475725).
Almost surely, 22531002025 is an apocalyptic number.
2531002025 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2531002025 is a deficient number, since it is larger than the sum of its proper divisors (642706675).
2531002025 is a wasteful number, since it uses less digits than its factorization.
2531002025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1137628 (or 1137623 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 20.
The square root of 2531002025 is about 50309.0650380227. The cubic root of 2531002025 is about 1362.7959394197.
Adding to 2531002025 its reverse (5202001352), we get a palindrome (7733003377).
The spelling of 2531002025 in words is "two billion, five hundred thirty-one million, two thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •