Base | Representation |
---|---|
bin | 10011101110000110010001 |
3 | 100201122021221 |
4 | 103232012101 |
5 | 2310411203 |
6 | 302445041 |
7 | 61640404 |
oct | 23560621 |
9 | 10648257 |
10 | 5169553 |
11 | 2a10a64 |
12 | 1893781 |
13 | 10c000c |
14 | 987d3b |
15 | 6c1abd |
hex | 4ee191 |
5169553 has 4 divisors (see below), whose sum is σ = 5177140. Its totient is φ = 5161968.
The previous prime is 5169551. The next prime is 5169559. The reversal of 5169553 is 3559615.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3559615 = 5 ⋅711923.
It can be written as a sum of positive squares in 2 ways, for example, as 2999824 + 2169729 = 1732^2 + 1473^2 .
It is a cyclic number.
It is not a de Polignac number, because 5169553 - 21 = 5169551 is a prime.
It is a super-5 number, since 5×51695535 (a number of 35 digits) contains 55555 as substring.
It is a Duffinian number.
5169553 is a lucky number.
It is not an unprimeable number, because it can be changed into a prime (5169551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2658 + ... + 4171.
It is an arithmetic number, because the mean of its divisors is an integer number (1294285).
Almost surely, 25169553 is an apocalyptic number.
It is an amenable number.
5169553 is a deficient number, since it is larger than the sum of its proper divisors (7587).
5169553 is an equidigital number, since it uses as much as digits as its factorization.
5169553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7586.
The product of its digits is 20250, while the sum is 34.
The square root of 5169553 is about 2273.6651028681. The cubic root of 5169553 is about 172.9090258652.
The spelling of 5169553 in words is "five million, one hundred sixty-nine thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •