Base | Representation |
---|---|
bin | 1001011011111011… |
… | …10101001010100000 |
3 | 111002001212010001221 |
4 | 10231331311022200 |
5 | 40333413304220 |
6 | 2154413104424 |
7 | 236354366152 |
oct | 45575651240 |
9 | 14061763057 |
10 | 5066150560 |
11 | 216a789999 |
12 | b94788114 |
13 | 629780233 |
14 | 360ba0ad2 |
15 | 1e9b719aa |
hex | 12df752a0 |
5066150560 has 96 divisors (see below), whose sum is σ = 12149222400. Its totient is φ = 1996093440.
The previous prime is 5066150521. The next prime is 5066150567. The reversal of 5066150560 is 650516605.
It is not an unprimeable number, because it can be changed into a prime (5066150567) 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 15 ways as a sum of consecutive naturals, for example, 5111665 + ... + 5112655.
It is an arithmetic number, because the mean of its divisors is an integer number (126554400).
Almost surely, 25066150560 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5066150560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6074611200).
5066150560 is an abundant number, since it is smaller than the sum of its proper divisors (7083071840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5066150560 is a wasteful number, since it uses less digits than its factorization.
5066150560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1454 (or 1446 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 34.
The square root of 5066150560 is about 71176.8962515225. The cubic root of 5066150560 is about 1717.4839903953.
The spelling of 5066150560 in words is "five billion, sixty-six million, one hundred fifty thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •