Base | Representation |
---|---|
bin | 1010100100110011… |
… | …11001110000000000 |
3 | 112122200012022222000 |
4 | 11102121321300000 |
5 | 43111414123102 |
6 | 2335212144000 |
7 | 260456601336 |
oct | 52231716000 |
9 | 15580168860 |
10 | 5677489152 |
11 | 24538816a5 |
12 | 1125468000 |
13 | 6c6318a4a |
14 | 3bc059b56 |
15 | 23367e01c |
hex | 152679c00 |
5677489152 has 352 divisors, whose sum is σ = 17813812800. Its totient is φ = 1783627776.
The previous prime is 5677489067. The next prime is 5677489163. The reversal of 5677489152 is 2519847765.
5677489152 is a `hidden beast` number, since 5 + 6 + 7 + 7 + 489 + 152 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 58530768 + ... + 58530864.
Almost surely, 25677489152 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 5677489152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8906906400).
5677489152 is an abundant number, since it is smaller than the sum of its proper divisors (12136323648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5677489152 is a wasteful number, since it uses less digits than its factorization.
5677489152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228 (or 204 counting only the distinct ones).
The product of its digits is 4233600, while the sum is 54.
The square root of 5677489152 is about 75349.1151374719. The cubic root of 5677489152 is about 1783.9613362759.
The spelling of 5677489152 in words is "five billion, six hundred seventy-seven million, four hundred eighty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •