Base | Representation |
---|---|
bin | 10011010010111101100101 |
3 | 100111222211100 |
4 | 103102331211 |
5 | 2243332110 |
6 | 300230313 |
7 | 60665352 |
oct | 23227545 |
9 | 10458740 |
10 | 5058405 |
11 | 2945500 |
12 | 183b399 |
13 | 1081551 |
14 | 959629 |
15 | 69dbc0 |
hex | 4d2f65 |
5058405 has 36 divisors (see below), whose sum is σ = 9647820. Its totient is φ = 2449920.
The previous prime is 5058397. The next prime is 5058409. The reversal of 5058405 is 5048505.
It can be written as a sum of positive squares in 2 ways, for example, as 736164 + 4322241 = 858^2 + 2079^2 .
It is not a de Polignac number, because 5058405 - 23 = 5058397 is a prime.
It is a super-2 number, since 2×50584052 = 51174922288050, which contains 22 as substring.
It is an Ulam number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5058409) 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 35 ways as a sum of consecutive naturals, for example, 4981 + ... + 5909.
It is an arithmetic number, because the mean of its divisors is an integer number (267995).
Almost surely, 25058405 is an apocalyptic number.
5058405 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5058405 is a deficient number, since it is larger than the sum of its proper divisors (4589415).
5058405 is a wasteful number, since it uses less digits than its factorization.
5058405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 962 (or 948 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 27.
The square root of 5058405 is about 2249.0898159033. The cubic root of 5058405 is about 171.6608265627.
The spelling of 5058405 in words is "five million, fifty-eight thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •