Base | Representation |
---|---|
bin | 1111110001100111011… |
… | …00100101100100101111 |
3 | 1220211002020002210102022 |
4 | 13320303230211210233 |
5 | 32340041000034201 |
6 | 1053001232420355 |
7 | 54106042141205 |
oct | 7706354454457 |
9 | 1824066083368 |
10 | 542033205551 |
11 | 199969682a02 |
12 | 890719a76bb |
13 | 3c162502736 |
14 | 1c33d851075 |
15 | e175d8b41b |
hex | 7e33b2592f |
542033205551 has 4 divisors (see below), whose sum is σ = 547098936552. Its totient is φ = 536967474552.
The previous prime is 542033205547. The next prime is 542033205559. The reversal of 542033205551 is 155502330245.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 155502330245 = 5 ⋅31100466049.
It is a cyclic number.
It is not a de Polignac number, because 542033205551 - 22 = 542033205547 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 (542033205559) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2532865340 + ... + 2532865553.
It is an arithmetic number, because the mean of its divisors is an integer number (136774734138).
Almost surely, 2542033205551 is an apocalyptic number.
542033205551 is a deficient number, since it is larger than the sum of its proper divisors (5065731001).
542033205551 is a wasteful number, since it uses less digits than its factorization.
542033205551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5065731000.
The product of its (nonzero) digits is 90000, while the sum is 35.
Adding to 542033205551 its reverse (155502330245), we get a palindrome (697535535796).
The spelling of 542033205551 in words is "five hundred forty-two billion, thirty-three million, two hundred five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •