Base | Representation |
---|---|
bin | 1001010100100110… |
… | …0000100010001100 |
3 | 20110101111220012002 |
4 | 2111021200202030 |
5 | 20111042011430 |
6 | 1052144531432 |
7 | 116003115455 |
oct | 22511404214 |
9 | 6411456162 |
10 | 2502297740 |
11 | 1074533368 |
12 | 59a020b78 |
13 | 30b555267 |
14 | 19a48c12c |
15 | e9a31845 |
hex | 9526088c |
2502297740 has 24 divisors (see below), whose sum is σ = 5303039280. Its totient is φ = 991735488.
The previous prime is 2502297713. The next prime is 2502297761. The reversal of 2502297740 is 477922052.
It is a super-2 number, since 2×25022977402 = 12522987959218215200, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2502297694 and 2502297703.
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, 571742 + ... + 576101.
It is an arithmetic number, because the mean of its divisors is an integer number (220959970).
Almost surely, 22502297740 is an apocalyptic number.
2502297740 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2502297740 is an abundant number, since it is smaller than the sum of its proper divisors (2800741540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2502297740 is a wasteful number, since it uses less digits than its factorization.
2502297740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1147961 (or 1147959 counting only the distinct ones).
The product of its (nonzero) digits is 70560, while the sum is 38.
The square root of 2502297740 is about 50022.9721228157. The cubic root of 2502297740 is about 1357.6244827042.
The spelling of 2502297740 in words is "two billion, five hundred two million, two hundred ninety-seven thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •