Base | Representation |
---|---|
bin | 1111110010010101110… |
… | …00101110111000111001 |
3 | 1220212002100012002012101 |
4 | 13321022320232320321 |
5 | 32341340044443101 |
6 | 1053104011343401 |
7 | 54121505116402 |
oct | 7711270567071 |
9 | 1825070162171 |
10 | 542422265401 |
11 | 19a049256375 |
12 | 89160151b61 |
13 | 3c1c4cb3573 |
14 | 1c3793a89a9 |
15 | e19a0dd401 |
hex | 7e4ae2ee39 |
542422265401 has 4 divisors (see below), whose sum is σ = 542428902400. Its totient is φ = 542415628404.
The previous prime is 542422265389. The next prime is 542422265443. The reversal of 542422265401 is 104562224245.
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.
It is a cyclic number.
It is not a de Polignac number, because 542422265401 - 29 = 542422264889 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (542422265201) 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, 3194361 + ... + 3359878.
It is an arithmetic number, because the mean of its divisors is an integer number (135607225600).
Almost surely, 2542422265401 is an apocalyptic number.
It is an amenable number.
542422265401 is a deficient number, since it is larger than the sum of its proper divisors (6636999).
542422265401 is an equidigital number, since it uses as much as digits as its factorization.
542422265401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6636998.
The product of its (nonzero) digits is 153600, while the sum is 37.
Adding to 542422265401 its reverse (104562224245), we get a palindrome (646984489646).
The spelling of 542422265401 in words is "five hundred forty-two billion, four hundred twenty-two million, two hundred sixty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •