Base | Representation |
---|---|
bin | 1111110010000010101… |
… | …10100100001000111011 |
3 | 1220211200012012200111001 |
4 | 13321001112210020323 |
5 | 32341023123013111 |
6 | 1053040055145431 |
7 | 54114523420411 |
oct | 7710126441073 |
9 | 1824605180431 |
10 | 542262313531 |
11 | 199a76a37144 |
12 | 89116675277 |
13 | 3c19ab0b9a3 |
14 | 1c36204d2b1 |
15 | e18b0451c1 |
hex | 7e415a423b |
542262313531 has 4 divisors (see below), whose sum is σ = 542678479312. Its totient is φ = 541846147752.
The previous prime is 542262313519. The next prime is 542262313561. The reversal of 542262313531 is 135313262245.
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-542262313531 is a prime.
It is a super-2 number, since 2×5422623135312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (542262313561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 208080936 + ... + 208083541.
It is an arithmetic number, because the mean of its divisors is an integer number (135669619828).
Almost surely, 2542262313531 is an apocalyptic number.
542262313531 is a deficient number, since it is larger than the sum of its proper divisors (416165781).
542262313531 is a wasteful number, since it uses less digits than its factorization.
542262313531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 416165780.
The product of its digits is 129600, while the sum is 37.
Adding to 542262313531 its reverse (135313262245), we get a palindrome (677575575776).
The spelling of 542262313531 in words is "five hundred forty-two billion, two hundred sixty-two million, three hundred thirteen thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •