Base | Representation |
---|---|
bin | 1001010101111110011110… |
… | …01111001100110011000111 |
3 | 2200202012121100112112221002 |
4 | 10222333033033030303013 |
5 | 10143112313143220223 |
6 | 111410501543443515 |
7 | 4220264413465646 |
oct | 452771717146307 |
9 | 80665540475832 |
10 | 20546305445063 |
11 | 66017038677a2 |
12 | 237a01815659b |
13 | b6067b936138 |
14 | 51063724b35d |
15 | 2596cad20e28 |
hex | 12afcf3cccc7 |
20546305445063 has 8 divisors (see below), whose sum is σ = 20571889695600. Its totient is φ = 20520722554560.
The previous prime is 20546305445051. The next prime is 20546305445191. The reversal of 20546305445063 is 36054450364502.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20546305445063 - 216 = 20546305379527 is a prime.
It is a super-2 number, since 2×205463054450632 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20546305444999 and 20546305445017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20546305945063) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31778588 + ... + 32418686.
It is an arithmetic number, because the mean of its divisors is an integer number (2571486211950).
Almost surely, 220546305445063 is an apocalyptic number.
20546305445063 is a deficient number, since it is larger than the sum of its proper divisors (25584250537).
20546305445063 is an equidigital number, since it uses as much as digits as its factorization.
20546305445063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 680017.
The product of its (nonzero) digits is 5184000, while the sum is 47.
The spelling of 20546305445063 in words is "twenty trillion, five hundred forty-six billion, three hundred five million, four hundred forty-five thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •