Base | Representation |
---|---|
bin | 11110001101101… |
… | …100010110111111 |
3 | 1022022211111101001 |
4 | 132031230112333 |
5 | 2014231443142 |
6 | 122144431131 |
7 | 15363426124 |
oct | 3615542677 |
9 | 1268744331 |
10 | 506906047 |
11 | 24015401a |
12 | 1219184a7 |
13 | 8103260b |
14 | 4b47274b |
15 | 2e77e5b7 |
hex | 1e36c5bf |
506906047 has 2 divisors, whose sum is σ = 506906048. Its totient is φ = 506906046.
The previous prime is 506906041. The next prime is 506906069. The reversal of 506906047 is 740609605.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-506906047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 506905997 and 506906015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (506906041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 253453023 + 253453024.
It is an arithmetic number, because the mean of its divisors is an integer number (253453024).
Almost surely, 2506906047 is an apocalyptic number.
506906047 is a deficient number, since it is larger than the sum of its proper divisors (1).
506906047 is an equidigital number, since it uses as much as digits as its factorization.
506906047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 37.
The square root of 506906047 is about 22514.5741021233. The cubic root of 506906047 is about 797.3380518434.
The spelling of 506906047 in words is "five hundred six million, nine hundred six thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •