Base | Representation |
---|---|
bin | 1001111001011111… |
… | …10011101001010000 |
3 | 111201100110220102110 |
4 | 10330233303221100 |
5 | 41340404220220 |
6 | 2235152145320 |
7 | 245455244562 |
oct | 47457635120 |
9 | 14640426373 |
10 | 5314132560 |
11 | 22877644a0 |
12 | 1043838240 |
13 | 668c67249 |
14 | 385ab3332 |
15 | 211807be0 |
hex | 13cbf3a50 |
5314132560 has 160 divisors (see below), whose sum is σ = 18146838528. Its totient is φ = 1275701760.
The previous prime is 5314132529. The next prime is 5314132567. The reversal of 5314132560 is 652314135.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5314132567) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 262149 + ... + 281691.
Almost surely, 25314132560 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 5314132560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9073419264).
5314132560 is an abundant number, since it is smaller than the sum of its proper divisors (12832705968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5314132560 is a wasteful number, since it uses less digits than its factorization.
5314132560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19673 (or 19667 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 30.
The square root of 5314132560 is about 72898.0970945058. The cubic root of 5314132560 is about 1745.0617307522.
Adding to 5314132560 its reverse (652314135), we get a palindrome (5966446695).
The spelling of 5314132560 in words is "five billion, three hundred fourteen million, one hundred thirty-two thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •