Base | Representation |
---|---|
bin | 1001010100100101… |
… | …1010000010011100 |
3 | 20110101110112200121 |
4 | 2111021122002130 |
5 | 20111040134012 |
6 | 1052144204324 |
7 | 116002645054 |
oct | 22511320234 |
9 | 6411415617 |
10 | 2502271132 |
11 | 1074515379 |
12 | 59a0096a4 |
13 | 30b54610a |
14 | 19a482564 |
15 | e9a28a07 |
hex | 9525a09c |
2502271132 has 24 divisors (see below), whose sum is σ = 4421047680. Its totient is φ = 1239164400.
The previous prime is 2502271127. The next prime is 2502271133. The reversal of 2502271132 is 2311722052.
It is a super-2 number, since 2×25022711322 = 12522721636081122848, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2502271097 and 2502271106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2502271133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 203619 + ... + 215557.
It is an arithmetic number, because the mean of its divisors is an integer number (184210320).
Almost surely, 22502271132 is an apocalyptic number.
It is an amenable number.
2502271132 is a deficient number, since it is larger than the sum of its proper divisors (1918776548).
2502271132 is a wasteful number, since it uses less digits than its factorization.
2502271132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12441 (or 12439 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 25.
The square root of 2502271132 is about 50022.7061643010. The cubic root of 2502271132 is about 1357.6196706202.
Adding to 2502271132 its reverse (2311722052), we get a palindrome (4813993184).
The spelling of 2502271132 in words is "two billion, five hundred two million, two hundred seventy-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •