Base | Representation |
---|---|
bin | 1010011100101010… |
… | …00111111101110000 |
3 | 112110220120012210210 |
4 | 11032111013331300 |
5 | 42441414042132 |
6 | 2324331024120 |
7 | 255666541152 |
oct | 51625077560 |
9 | 15426505723 |
10 | 5609127792 |
11 | 241922a804 |
12 | 110659b040 |
13 | 6b5102038 |
14 | 3b2d42ad2 |
15 | 22c678bcc |
hex | 14e547f70 |
5609127792 has 80 divisors (see below), whose sum is σ = 14710085280. Its totient is φ = 1841550336.
The previous prime is 5609127773. The next prime is 5609127793. The reversal of 5609127792 is 2977219065.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5609127793) 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, 902038 + ... + 908234.
It is an arithmetic number, because the mean of its divisors is an integer number (183876066).
Almost surely, 25609127792 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 5609127792, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7355042640).
5609127792 is an abundant number, since it is smaller than the sum of its proper divisors (9100957488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5609127792 is a wasteful number, since it uses less digits than its factorization.
5609127792 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6490 (or 6484 counting only the distinct ones).
The product of its (nonzero) digits is 476280, while the sum is 48.
The square root of 5609127792 is about 74894.1105294669. The cubic root of 5609127792 is about 1776.7723134407.
The spelling of 5609127792 in words is "five billion, six hundred nine million, one hundred twenty-seven thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •