Base | Representation |
---|---|
bin | 10011010111001001101101 |
3 | 100112212100220 |
4 | 103113021231 |
5 | 2244404230 |
6 | 300441553 |
7 | 61066365 |
oct | 23271155 |
9 | 10485326 |
10 | 5075565 |
11 | 2957390 |
12 | 18492b9 |
13 | 10892c1 |
14 | 9619a5 |
15 | 6a3d10 |
hex | 4d726d |
5075565 has 32 divisors (see below), whose sum is σ = 9331200. Its totient is φ = 2329920.
The previous prime is 5075561. The next prime is 5075573. The reversal of 5075565 is 5655705.
5075565 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5075565 - 22 = 5075561 is a prime.
It is a super-2 number, since 2×50755652 = 51522720138450, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5075561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2326 + ... + 3944.
It is an arithmetic number, because the mean of its divisors is an integer number (291600).
Almost surely, 25075565 is an apocalyptic number.
5075565 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5075565 is a deficient number, since it is larger than the sum of its proper divisors (4255635).
5075565 is a wasteful number, since it uses less digits than its factorization.
5075565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1657.
The product of its (nonzero) digits is 26250, while the sum is 33.
The square root of 5075565 is about 2252.9014625589. The cubic root of 5075565 is about 171.8547200315.
The spelling of 5075565 in words is "five million, seventy-five thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •