Base | Representation |
---|---|
bin | 1010000010001111… |
… | …10111100111100000 |
3 | 111220110121212001111 |
4 | 11001013313213200 |
5 | 42013203033102 |
6 | 2250333513104 |
7 | 250336261246 |
oct | 50107674740 |
9 | 14813555044 |
10 | 5387549152 |
11 | 2315149467 |
12 | 1064342794 |
13 | 67b230c0b |
14 | 391744796 |
15 | 217eaacd7 |
hex | 1411f79e0 |
5387549152 has 48 divisors (see below), whose sum is σ = 11306206800. Its totient is φ = 2518263808.
The previous prime is 5387549131. The next prime is 5387549159. The reversal of 5387549152 is 2519457835.
It is a junction number, because it is equal to n+sod(n) for n = 5387549096 and 5387549105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5387549159) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47823 + ... + 114289.
It is an arithmetic number, because the mean of its divisors is an integer number (235545975).
Almost surely, 25387549152 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 5387549152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5653103400).
5387549152 is an abundant number, since it is smaller than the sum of its proper divisors (5918657648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5387549152 is a wasteful number, since it uses less digits than its factorization.
5387549152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66643 (or 66635 counting only the distinct ones).
The product of its digits is 1512000, while the sum is 49.
The square root of 5387549152 is about 73399.9261035050. The cubic root of 5387549152 is about 1753.0612163618.
The spelling of 5387549152 in words is "five billion, three hundred eighty-seven million, five hundred forty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •