Base | Representation |
---|---|
bin | 1001111001011010… |
… | …11001001111010000 |
3 | 111201022021202212110 |
4 | 10330231121033100 |
5 | 41340224000422 |
6 | 2235130425320 |
7 | 245450001654 |
oct | 47455311720 |
9 | 14638252773 |
10 | 5313500112 |
11 | 2287372308 |
12 | 1043592240 |
13 | 668aa540b |
14 | 38598aa64 |
15 | 21173060c |
hex | 13cb593d0 |
5313500112 has 80 divisors (see below), whose sum is σ = 14465467008. Its totient is φ = 1677350400.
The previous prime is 5313500077. The next prime is 5313500113. The reversal of 5313500112 is 2110053135.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5313500113) 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, 87678 + ... + 135330.
Almost surely, 25313500112 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 5313500112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7232733504).
5313500112 is an abundant number, since it is smaller than the sum of its proper divisors (9151966896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5313500112 is a wasteful number, since it uses less digits than its factorization.
5313500112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47788 (or 47782 counting only the distinct ones).
The product of its (nonzero) digits is 450, while the sum is 21.
The square root of 5313500112 is about 72893.7590744228. The cubic root of 5313500112 is about 1744.9924999746.
Adding to 5313500112 its reverse (2110053135), we get a palindrome (7423553247).
The spelling of 5313500112 in words is "five billion, three hundred thirteen million, five hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •