Base | Representation |
---|---|
bin | 100000010011101… |
… | …000010011011011 |
3 | 1101202220022011202 |
4 | 200103220103123 |
5 | 2102224013411 |
6 | 125441144415 |
7 | 16301031464 |
oct | 4023502333 |
9 | 1352808152 |
10 | 542016731 |
11 | 258a55213 |
12 | 13162b10b |
13 | 883a6879 |
14 | 51db1d6b |
15 | 328b783b |
hex | 204e84db |
542016731 has 2 divisors, whose sum is σ = 542016732. Its totient is φ = 542016730.
The previous prime is 542016721. The next prime is 542016733. The reversal of 542016731 is 137610245.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-542016731 is a prime.
It is a super-2 number, since 2×5420167312 = 587564273367852722, which contains 22 as substring.
Together with 542016733, 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 = 542016694 and 542016703.
It is not a weakly prime, because it can be changed into another prime (542016733) 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, 271008365 + 271008366.
It is an arithmetic number, because the mean of its divisors is an integer number (271008366).
Almost surely, 2542016731 is an apocalyptic number.
542016731 is a deficient number, since it is larger than the sum of its proper divisors (1).
542016731 is an equidigital number, since it uses as much as digits as its factorization.
542016731 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 29.
The square root of 542016731 is about 23281.2527798656. The cubic root of 542016731 is about 815.3377756060.
Adding to 542016731 its reverse (137610245), we get a palindrome (679626976).
The spelling of 542016731 in words is "five hundred forty-two million, sixteen thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •