Base | Representation |
---|---|
bin | 100000100100111… |
… | …001000111011001 |
3 | 1102002102012201211 |
4 | 200210321013121 |
5 | 2104403321131 |
6 | 130122143121 |
7 | 16354350013 |
oct | 4044710731 |
9 | 1362365654 |
10 | 546542041 |
11 | 260566141 |
12 | 133051aa1 |
13 | 892cc576 |
14 | 5282d1b3 |
15 | 32ead5b1 |
hex | 209391d9 |
546542041 has 2 divisors, whose sum is σ = 546542042. Its totient is φ = 546542040.
The previous prime is 546541979. The next prime is 546542089. The reversal of 546542041 is 140245645.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 434097225 + 112444816 = 20835^2 + 10604^2 .
It is a cyclic number.
It is not a de Polignac number, because 546542041 - 29 = 546541529 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 546541994 and 546542012.
It is not a weakly prime, because it can be changed into another prime (546542441) 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, 273271020 + 273271021.
It is an arithmetic number, because the mean of its divisors is an integer number (273271021).
Almost surely, 2546542041 is an apocalyptic number.
It is an amenable number.
546542041 is a deficient number, since it is larger than the sum of its proper divisors (1).
546542041 is an equidigital number, since it uses as much as digits as its factorization.
546542041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19200, while the sum is 31.
The square root of 546542041 is about 23378.2386205634. The cubic root of 546542041 is about 817.6005810401.
Adding to 546542041 its reverse (140245645), we get a palindrome (686787686).
The spelling of 546542041 in words is "five hundred forty-six million, five hundred forty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •