Base | Representation |
---|---|
bin | 1001010111111101… |
… | …0110011101100100 |
3 | 20111101001222200002 |
4 | 2111333112131210 |
5 | 20123200143020 |
6 | 1053411240432 |
7 | 116234102615 |
oct | 22577263544 |
9 | 6441058602 |
10 | 2516412260 |
11 | 10814a385a |
12 | 5a28a9118 |
13 | 31145784b |
14 | 19c2c3c0c |
15 | eadbd975 |
hex | 95fd6764 |
2516412260 has 48 divisors (see below), whose sum is σ = 5436027072. Its totient is φ = 978096000.
The previous prime is 2516412257. The next prime is 2516412263. The reversal of 2516412260 is 622146152.
It is an interprime number because it is at equal distance from previous prime (2516412257) and next prime (2516412263).
It is not an unprimeable number, because it can be changed into a prime (2516412263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 88835 + ... + 113685.
It is an arithmetic number, because the mean of its divisors is an integer number (113250564).
Almost surely, 22516412260 is an apocalyptic number.
2516412260 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2516412260 is an abundant number, since it is smaller than the sum of its proper divisors (2919614812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2516412260 is a wasteful number, since it uses less digits than its factorization.
2516412260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25004 (or 25002 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 29.
The square root of 2516412260 is about 50163.8541182792. The cubic root of 2516412260 is about 1360.1723145275.
The spelling of 2516412260 in words is "two billion, five hundred sixteen million, four hundred twelve thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •