Base | Representation |
---|---|
bin | 111101101000110001100000… |
… | …1101001011011010011100111 |
3 | 2122002122112002002202221021012 |
4 | 1323101203001221123103213 |
5 | 1032030320032001233421 |
6 | 5201031230424412435 |
7 | 222125112003250331 |
oct | 17321430151332347 |
9 | 2562575062687235 |
10 | 542165560571111 |
11 | 1478291397961a4 |
12 | 5098339931711b |
13 | 1a369cba78cc99 |
14 | 97c4d4b5dc451 |
15 | 42a2e8531b95b |
hex | 1ed18c1a5b4e7 |
542165560571111 has 4 divisors (see below), whose sum is σ = 542881763425992. Its totient is φ = 541449357716232.
The previous prime is 542165560571081. The next prime is 542165560571113. The reversal of 542165560571111 is 111175065561245.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-542165560571111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 542165560571111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (542165560571113) 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, 358101426305 + ... + 358101427818.
It is an arithmetic number, because the mean of its divisors is an integer number (135720440856498).
Almost surely, 2542165560571111 is an apocalyptic number.
542165560571111 is a deficient number, since it is larger than the sum of its proper divisors (716202854881).
542165560571111 is an equidigital number, since it uses as much as digits as its factorization.
542165560571111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 716202854880.
The product of its (nonzero) digits is 1260000, while the sum is 50.
The spelling of 542165560571111 in words is "five hundred forty-two trillion, one hundred sixty-five billion, five hundred sixty million, five hundred seventy-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •