Base | Representation |
---|---|
bin | 1010011100001110… |
… | …11001110010100000 |
3 | 112110122210110122021 |
4 | 11032013121302200 |
5 | 42440003441114 |
6 | 2324121551224 |
7 | 255624140230 |
oct | 51607316240 |
9 | 15418713567 |
10 | 5605530784 |
11 | 24171a3277 |
12 | 1105345514 |
13 | 6b4442a29 |
14 | 3b2687cc0 |
15 | 22c1b8024 |
hex | 14e1d9ca0 |
5605530784 has 96 divisors (see below), whose sum is σ = 13635457920. Its totient is φ = 2214355968.
The previous prime is 5605530781. The next prime is 5605530797. The reversal of 5605530784 is 4870355065.
It is a self number, because there is not a number n which added to its sum of digits gives 5605530784.
It is not an unprimeable number, because it can be changed into a prime (5605530781) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 139674 + ... + 175270.
It is an arithmetic number, because the mean of its divisors is an integer number (142036020).
Almost surely, 25605530784 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 5605530784, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6817728960).
5605530784 is an abundant number, since it is smaller than the sum of its proper divisors (8029927136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5605530784 is a wasteful number, since it uses less digits than its factorization.
5605530784 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35670 (or 35662 counting only the distinct ones).
The product of its (nonzero) digits is 504000, while the sum is 43.
The square root of 5605530784 is about 74870.0927206585. The cubic root of 5605530784 is about 1776.3924307983.
The spelling of 5605530784 in words is "five billion, six hundred five million, five hundred thirty thousand, seven hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •