Base | Representation |
---|---|
bin | 11101111011001… |
… | …100110001001101 |
3 | 1021222201012012000 |
4 | 131323030301031 |
5 | 2012011324221 |
6 | 121452502513 |
7 | 15304265061 |
oct | 3573146115 |
9 | 1258635160 |
10 | 502058061 |
11 | 23844271a |
12 | 12017aa39 |
13 | 80025a9b |
14 | 4a96daa1 |
15 | 2e122e26 |
hex | 1deccc4d |
502058061 has 8 divisors (see below), whose sum is σ = 743789760. Its totient is φ = 334705356.
The previous prime is 502058047. The next prime is 502058107. The reversal of 502058061 is 160850205.
502058061 is a `hidden beast` number, since 5 + 0 + 20 + 580 + 61 = 666.
It is not a de Polignac number, because 502058061 - 210 = 502057037 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 18594743 = 502058061 / (5 + 0 + 2 + 0 + 5 + 8 + 0 + 6 + 1).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (502058021) 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 7 ways as a sum of consecutive naturals, for example, 9297345 + ... + 9297398.
It is an arithmetic number, because the mean of its divisors is an integer number (92973720).
Almost surely, 2502058061 is an apocalyptic number.
It is an amenable number.
502058061 is a deficient number, since it is larger than the sum of its proper divisors (241731699).
502058061 is a wasteful number, since it uses less digits than its factorization.
502058061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18594752 (or 18594746 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
The square root of 502058061 is about 22406.6521595708. The cubic root of 502058061 is about 794.7880246525.
The spelling of 502058061 in words is "five hundred two million, fifty-eight thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •