Base | Representation |
---|---|
bin | 1010001111001100… |
… | …00011101001100000 |
3 | 112012000221010120000 |
4 | 11013212003221200 |
5 | 42224002013143 |
6 | 2305213020000 |
7 | 253125205050 |
oct | 50746035140 |
9 | 15160833500 |
10 | 5496126048 |
11 | 2370468936 |
12 | 1094784600 |
13 | 6978885ba |
14 | 3a1d29560 |
15 | 2227a6bd3 |
hex | 147983a60 |
5496126048 has 480 divisors, whose sum is σ = 19758816000. Its totient is φ = 1463878656.
The previous prime is 5496126011. The next prime is 5496126071. The reversal of 5496126048 is 8406216945.
5496126048 is a `hidden beast` number, since 549 + 6 + 1 + 2 + 60 + 48 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 5496125994 and 5496126012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 36886678 + ... + 36886826.
It is an arithmetic number, because the mean of its divisors is an integer number (41164200).
Almost surely, 25496126048 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 5496126048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9879408000).
5496126048 is an abundant number, since it is smaller than the sum of its proper divisors (14262689952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5496126048 is a wasteful number, since it uses less digits than its factorization.
5496126048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 304 (or 287 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 45.
The square root of 5496126048 is about 74135.8620911634. The cubic root of 5496126048 is about 1764.7596339580.
The spelling of 5496126048 in words is "five billion, four hundred ninety-six million, one hundred twenty-six thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •