Base | Representation |
---|---|
bin | 1010010110110101… |
… | …11010110101110010 |
3 | 112100111201021120212 |
4 | 11023122322311302 |
5 | 42341420042000 |
6 | 2315424504122 |
7 | 254534620430 |
oct | 51332726562 |
9 | 15314637525 |
10 | 5560315250 |
11 | 23a3720166 |
12 | 10b217b042 |
13 | 6a7c71289 |
14 | 3aa677d50 |
15 | 228235c35 |
hex | 14b6bad72 |
5560315250 has 64 divisors (see below), whose sum is σ = 12039535872. Its totient is φ = 1883376000.
The previous prime is 5560315247. The next prime is 5560315253. The reversal of 5560315250 is 525130655.
It is an interprime number because it is at equal distance from previous prime (5560315247) and next prime (5560315253).
It is not an unprimeable number, because it can be changed into a prime (5560315253) 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 31 ways as a sum of consecutive naturals, for example, 126110 + ... + 164390.
It is an arithmetic number, because the mean of its divisors is an integer number (188117748).
Almost surely, 25560315250 is an apocalyptic number.
5560315250 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5560315250 is an abundant number, since it is smaller than the sum of its proper divisors (6479220622).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5560315250 is a wasteful number, since it uses less digits than its factorization.
5560315250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38388 (or 38378 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 32.
The square root of 5560315250 is about 74567.5214151577. The cubic root of 5560315250 is about 1771.6032639367.
The spelling of 5560315250 in words is "five billion, five hundred sixty million, three hundred fifteen thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •