Base | Representation |
---|---|
bin | 1010011100001011… |
… | …01010100001111101 |
3 | 112110121221022111221 |
4 | 11032011222201331 |
5 | 42434344400234 |
6 | 2324104113341 |
7 | 255620231506 |
oct | 51605524175 |
9 | 15417838457 |
10 | 5605075069 |
11 | 2416a11950 |
12 | 1105165851 |
13 | 6b4313489 |
14 | 3b25a9bad |
15 | 22c127eb4 |
hex | 14e16a87d |
5605075069 has 32 divisors (see below), whose sum is σ = 6606927360. Its totient is φ = 4700203200.
The previous prime is 5605075067. The next prime is 5605075087. The reversal of 5605075069 is 9605705065.
It is not a de Polignac number, because 5605075069 - 21 = 5605075067 is a prime.
It is a super-2 number, since 2×56050750692 = 62833733058250709522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (43).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5605075067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3567054 + ... + 3568624.
It is an arithmetic number, because the mean of its divisors is an integer number (206466480).
Almost surely, 25605075069 is an apocalyptic number.
It is an amenable number.
5605075069 is a deficient number, since it is larger than the sum of its proper divisors (1001852291).
5605075069 is a wasteful number, since it uses less digits than its factorization.
5605075069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2041.
The product of its (nonzero) digits is 283500, while the sum is 43.
The square root of 5605075069 is about 74867.0492873868. The cubic root of 5605075069 is about 1776.3442908067.
The spelling of 5605075069 in words is "five billion, six hundred five million, seventy-five thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •