Base | Representation |
---|---|
bin | 1111110010101100010… |
… | …01001001000011010101 |
3 | 1220212120111112200212002 |
4 | 13321112021021003111 |
5 | 32342231421204440 |
6 | 1053134435205045 |
7 | 54126260250062 |
oct | 7712611110325 |
9 | 1825514480762 |
10 | 542611116245 |
11 | 19a135913850 |
12 | 891b3446785 |
13 | 3c225165c23 |
14 | 1c3964c7c69 |
15 | e1ab994115 |
hex | 7e562490d5 |
542611116245 has 32 divisors (see below), whose sum is σ = 733597876224. Its totient is φ = 381710548800.
The previous prime is 542611116227. The next prime is 542611116283.
542611116245 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 542611116245 - 218 = 542610854101 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 542611116199 and 542611116208.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 3475124 + ... + 3627906.
It is an arithmetic number, because the mean of its divisors is an integer number (22924933632).
Almost surely, 2542611116245 is an apocalyptic number.
542611116245 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
542611116245 is a deficient number, since it is larger than the sum of its proper divisors (190986759979).
542611116245 is a wasteful number, since it uses less digits than its factorization.
542611116245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154913.
The product of its digits is 57600, while the sum is 38.
It can be divided in two parts, 542611 and 116245, that added together give a palindrome (658856).
The spelling of 542611116245 in words is "five hundred forty-two billion, six hundred eleven million, one hundred sixteen thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •