Base | Representation |
---|---|
bin | 11110001100101… |
… | …100101010010101 |
3 | 1022022100020110212 |
4 | 132030230222111 |
5 | 2014200121031 |
6 | 122135055205 |
7 | 15361261352 |
oct | 3614545225 |
9 | 1268306425 |
10 | 506645141 |
11 | 23aa95aa2 |
12 | 121811505 |
13 | 80c70932 |
14 | 4b405629 |
15 | 2e72c12b |
hex | 1e32ca95 |
506645141 has 2 divisors, whose sum is σ = 506645142. Its totient is φ = 506645140.
The previous prime is 506645119. The next prime is 506645143. The reversal of 506645141 is 141546605.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 455822500 + 50822641 = 21350^2 + 7129^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-506645141 is a prime.
Together with 506645143, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 506645098 and 506645107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (506645143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 253322570 + 253322571.
It is an arithmetic number, because the mean of its divisors is an integer number (253322571).
Almost surely, 2506645141 is an apocalyptic number.
It is an amenable number.
506645141 is a deficient number, since it is larger than the sum of its proper divisors (1).
506645141 is an equidigital number, since it uses as much as digits as its factorization.
506645141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14400, while the sum is 32.
The square root of 506645141 is about 22508.7791983484. The cubic root of 506645141 is about 797.2012309707.
The spelling of 506645141 in words is "five hundred six million, six hundred forty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •