Base | Representation |
---|---|
bin | 10011010011111101001001 |
3 | 100112012102000 |
4 | 103103331021 |
5 | 2243444343 |
6 | 300301213 |
7 | 61013253 |
oct | 23237511 |
9 | 10465360 |
10 | 5062473 |
11 | 2948569 |
12 | 1841809 |
13 | 1083360 |
14 | 95acd3 |
15 | 69eed3 |
hex | 4d3f49 |
5062473 has 16 divisors (see below), whose sum is σ = 8077440. Its totient is φ = 3115152.
The previous prime is 5062469. The next prime is 5062483. The reversal of 5062473 is 3742605.
It is a happy number.
It is not a de Polignac number, because 5062473 - 22 = 5062469 is a prime.
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a d-powerful number, because it can be written as 5 + 0 + 62 + 29 + 49 + 75 + 314 .
It is not an unprimeable number, because it can be changed into a prime (5062403) 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 15 ways as a sum of consecutive naturals, for example, 6861 + ... + 7562.
It is an arithmetic number, because the mean of its divisors is an integer number (504840).
Almost surely, 25062473 is an apocalyptic number.
It is an amenable number.
5062473 is a deficient number, since it is larger than the sum of its proper divisors (3014967).
5062473 is a wasteful number, since it uses less digits than its factorization.
5062473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14445 (or 14439 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 27.
The square root of 5062473 is about 2249.9939999920. The cubic root of 5062473 is about 171.7068311253.
Adding to 5062473 its sum of digits (27), we get a square (5062500 = 22502).
The spelling of 5062473 in words is "five million, sixty-two thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •