Base | Representation |
---|---|
bin | 1001010101100110… |
… | …1011000110011101 |
3 | 20110200111012001200 |
4 | 2111121223012131 |
5 | 20113133112300 |
6 | 1052415430113 |
7 | 116054125110 |
oct | 22531530635 |
9 | 6420435050 |
10 | 2506535325 |
11 | 10769680a8 |
12 | 59b525339 |
13 | 30c3a9cc8 |
14 | 19ac72577 |
15 | ea0bc200 |
hex | 9566b19d |
2506535325 has 72 divisors (see below), whose sum is σ = 5207636928. Its totient is φ = 1128695040.
The previous prime is 2506535299. The next prime is 2506535329. The reversal of 2506535325 is 5235356052.
It is not a de Polignac number, because 2506535325 - 25 = 2506535293 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2506535325.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2506535329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 93649 + ... + 117401.
Almost surely, 22506535325 is an apocalyptic number.
2506535325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2506535325 is an abundant number, since it is smaller than the sum of its proper divisors (2701101603).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2506535325 is a wasteful number, since it uses less digits than its factorization.
2506535325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23843 (or 23835 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 36.
The square root of 2506535325 is about 50065.3105952615. The cubic root of 2506535325 is about 1358.3904193538.
The spelling of 2506535325 in words is "two billion, five hundred six million, five hundred thirty-five thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •