Base | Representation |
---|---|
bin | 100000010011110… |
… | …110110111001001 |
3 | 1101210000022222021 |
4 | 200103312313021 |
5 | 2102232420421 |
6 | 125442324441 |
7 | 16301400361 |
oct | 4023666711 |
9 | 1353008867 |
10 | 542076361 |
11 | 258a95aa2 |
12 | 131659721 |
13 | 883c7a58 |
14 | 51dc99a1 |
15 | 328ca341 |
hex | 204f6dc9 |
542076361 has 4 divisors (see below), whose sum is σ = 554682832. Its totient is φ = 529469892.
The previous prime is 542076343. The next prime is 542076407. The reversal of 542076361 is 163670245.
It is a happy number.
542076361 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 163670245 = 5 ⋅32734049.
It is a cyclic number.
It is not a de Polignac number, because 542076361 - 219 = 541552073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (542076341) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6303171 + ... + 6303256.
It is an arithmetic number, because the mean of its divisors is an integer number (138670708).
Almost surely, 2542076361 is an apocalyptic number.
It is an amenable number.
542076361 is a deficient number, since it is larger than the sum of its proper divisors (12606471).
542076361 is a wasteful number, since it uses less digits than its factorization.
542076361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12606470.
The product of its (nonzero) digits is 30240, while the sum is 34.
The square root of 542076361 is about 23282.5333887874. The cubic root of 542076361 is about 815.3676743194.
The spelling of 542076361 in words is "five hundred forty-two million, seventy-six thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •