Base | Representation |
---|---|
bin | 100000010101101… |
… | …110011011111101 |
3 | 1101210221012211021 |
4 | 200111232123331 |
5 | 2102344104031 |
6 | 125501024141 |
7 | 16305510325 |
oct | 4025563375 |
9 | 1353835737 |
10 | 542566141 |
11 | 25929aa77 |
12 | 131855051 |
13 | 88539970 |
14 | 520b6285 |
15 | 32975511 |
hex | 2056e6fd |
542566141 has 8 divisors (see below), whose sum is σ = 595327320. Its totient is φ = 491380032.
The previous prime is 542566121. The next prime is 542566153. The reversal of 542566141 is 141665245.
It can be written as a sum of positive squares in 4 ways, for example, as 26822041 + 515744100 = 5179^2 + 22710^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 542566141 - 29 = 542565629 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 542566097 and 542566106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (542566111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 393046 + ... + 394423.
It is an arithmetic number, because the mean of its divisors is an integer number (74415915).
Almost surely, 2542566141 is an apocalyptic number.
It is an amenable number.
542566141 is a deficient number, since it is larger than the sum of its proper divisors (52761179).
542566141 is a wasteful number, since it uses less digits than its factorization.
542566141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 787535.
The product of its digits is 28800, while the sum is 34.
The square root of 542566141 is about 23293.0491992783. The cubic root of 542566141 is about 815.6131689852.
The spelling of 542566141 in words is "five hundred forty-two million, five hundred sixty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •