Base | Representation |
---|---|
bin | 100000010100011… |
… | …000001110111101 |
3 | 1101210021021110221 |
4 | 200110120032331 |
5 | 2102301304203 |
6 | 125445301341 |
7 | 16302510034 |
oct | 4024301675 |
9 | 1353237427 |
10 | 542213053 |
11 | 259079768 |
12 | 131704851 |
13 | 88445035 |
14 | 5202371b |
15 | 32905abd |
hex | 205183bd |
542213053 has 4 divisors (see below), whose sum is σ = 542290140. Its totient is φ = 542135968.
The previous prime is 542213047. The next prime is 542213081. The reversal of 542213053 is 350312245.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 244547044 + 297666009 = 15638^2 + 17253^2 .
It is a cyclic number.
It is not a de Polignac number, because 542213053 - 225 = 508658621 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (542213083) 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 in 3 ways as a sum of consecutive naturals, for example, 26800 + ... + 42457.
It is an arithmetic number, because the mean of its divisors is an integer number (135572535).
Almost surely, 2542213053 is an apocalyptic number.
It is an amenable number.
542213053 is a deficient number, since it is larger than the sum of its proper divisors (77087).
542213053 is an equidigital number, since it uses as much as digits as its factorization.
542213053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77086.
The product of its (nonzero) digits is 3600, while the sum is 25.
The square root of 542213053 is about 23285.4687090469. The cubic root of 542213053 is about 815.4362039456.
Adding to 542213053 its reverse (350312245), we get a palindrome (892525298).
The spelling of 542213053 in words is "five hundred forty-two million, two hundred thirteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •