Base | Representation |
---|---|
bin | 1111011100010100101 |
3 | 221201010112 |
4 | 1323202211 |
5 | 112143041 |
6 | 14502405 |
7 | 4205165 |
oct | 1734245 |
9 | 851115 |
10 | 506021 |
11 | 3161aa |
12 | 204a05 |
13 | 149429 |
14 | d25a5 |
15 | 9edeb |
hex | 7b8a5 |
506021 has 4 divisors (see below), whose sum is σ = 523500. Its totient is φ = 488544.
The previous prime is 505979. The next prime is 506047. The reversal of 506021 is 120605.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 120605 = 5 ⋅24121.
It can be written as a sum of positive squares in 2 ways, for example, as 422500 + 83521 = 650^2 + 289^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-506021 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 505987 and 506005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (506071) 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, 8696 + ... + 8753.
It is an arithmetic number, because the mean of its divisors is an integer number (130875).
2506021 is an apocalyptic number.
It is an amenable number.
506021 is a deficient number, since it is larger than the sum of its proper divisors (17479).
506021 is a wasteful number, since it uses less digits than its factorization.
506021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17478.
The product of its (nonzero) digits is 60, while the sum is 14.
The square root of 506021 is about 711.3515305389. The cubic root of 506021 is about 79.6873736510.
Adding to 506021 its reverse (120605), we get a palindrome (626626).
The spelling of 506021 in words is "five hundred six thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •