Base | Representation |
---|---|
bin | 1010011100101111… |
… | …00001011111100101 |
3 | 112110221202011102122 |
4 | 11032113201133211 |
5 | 42442044203040 |
6 | 2324352315325 |
7 | 256005100433 |
oct | 51627413745 |
9 | 15427664378 |
10 | 5609756645 |
11 | 241961a219 |
12 | 1106842b45 |
13 | 6b529233c |
14 | 3b3067d53 |
15 | 22c7501b5 |
hex | 14e5e17e5 |
5609756645 has 32 divisors (see below), whose sum is σ = 7334673120. Its totient is φ = 4102758400.
The previous prime is 5609756627. The next prime is 5609756681. The reversal of 5609756645 is 5466579065.
It is a happy number.
It can be written as a sum of positive squares in 16 ways, for example, as 434680801 + 5175075844 = 20849^2 + 71938^2 .
It is not a de Polignac number, because 5609756645 - 28 = 5609756389 is a prime.
It is a super-2 number, since 2×56097566452 = 62938739232243312050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (53).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 448841 + ... + 461169.
It is an arithmetic number, because the mean of its divisors is an integer number (229208535).
Almost surely, 25609756645 is an apocalyptic number.
It is an amenable number.
5609756645 is a deficient number, since it is larger than the sum of its proper divisors (1724916475).
5609756645 is a wasteful number, since it uses less digits than its factorization.
5609756645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12505.
The product of its (nonzero) digits is 6804000, while the sum is 53.
The square root of 5609756645 is about 74898.3086925199. The cubic root of 5609756645 is about 1776.8387103856.
The spelling of 5609756645 in words is "five billion, six hundred nine million, seven hundred fifty-six thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •