Base | Representation |
---|---|
bin | 100000000111101… |
… | …001001001011101 |
3 | 1101112222122210101 |
4 | 200013221021131 |
5 | 2100422440321 |
6 | 125245541101 |
7 | 16232233366 |
oct | 4007511135 |
9 | 1345878711 |
10 | 538874461 |
11 | 2571a93a4 |
12 | 130574791 |
13 | 87846538 |
14 | 517d4b6d |
15 | 32496791 |
hex | 201e925d |
538874461 has 2 divisors, whose sum is σ = 538874462. Its totient is φ = 538874460.
The previous prime is 538874459. The next prime is 538874507. The reversal of 538874461 is 164478835.
It is a happy number.
It is an a-pointer prime, because the next prime (538874507) can be obtained adding 538874461 to its sum of digits (46).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 457532100 + 81342361 = 21390^2 + 9019^2 .
It is a cyclic number.
It is not a de Polignac number, because 538874461 - 21 = 538874459 is a prime.
Together with 538874459, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (538874261) 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 as a sum of consecutive naturals, namely, 269437230 + 269437231.
It is an arithmetic number, because the mean of its divisors is an integer number (269437231).
Almost surely, 2538874461 is an apocalyptic number.
It is an amenable number.
538874461 is a deficient number, since it is larger than the sum of its proper divisors (1).
538874461 is an equidigital number, since it uses as much as digits as its factorization.
538874461 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 645120, while the sum is 46.
The square root of 538874461 is about 23213.6697012773. The cubic root of 538874461 is about 813.7591168262.
The spelling of 538874461 in words is "five hundred thirty-eight million, eight hundred seventy-four thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •