Base | Representation |
---|---|
bin | 100000010101011… |
… | …011000111000101 |
3 | 1101210210012020102 |
4 | 200111123013011 |
5 | 2102334040411 |
6 | 125455213445 |
7 | 16305030461 |
oct | 4025330705 |
9 | 1353705212 |
10 | 542486981 |
11 | 259246553 |
12 | 131817285 |
13 | 8850c91a |
14 | 520954a1 |
15 | 3295bd3b |
hex | 2055b1c5 |
542486981 has 2 divisors, whose sum is σ = 542486982. Its totient is φ = 542486980.
The previous prime is 542486929. The next prime is 542487013. The reversal of 542486981 is 189684245.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 315382081 + 227104900 = 17759^2 + 15070^2 .
It is a cyclic number.
It is not a de Polignac number, because 542486981 - 214 = 542470597 is a prime.
It is a super-2 number, since 2×5424869812 = 588584249108988722, which contains 22 as substring.
It is equal to p28471988 and since 542486981 and 28471988 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (542486911) 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, 271243490 + 271243491.
It is an arithmetic number, because the mean of its divisors is an integer number (271243491).
Almost surely, 2542486981 is an apocalyptic number.
It is an amenable number.
542486981 is a deficient number, since it is larger than the sum of its proper divisors (1).
542486981 is an equidigital number, since it uses as much as digits as its factorization.
542486981 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 552960, while the sum is 47.
The square root of 542486981 is about 23291.3499179416. The cubic root of 542486981 is about 815.5735012693.
The spelling of 542486981 in words is "five hundred forty-two million, four hundred eighty-six thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •