Base | Representation |
---|---|
bin | 1011000100001100000001… |
… | …1011100001110010110101 |
3 | 1121002010001120212201120101 |
4 | 2301003000123201302311 |
5 | 3043314121402332203 |
6 | 41513125304034101 |
7 | 2364002043112300 |
oct | 261030033416265 |
9 | 47063046781511 |
10 | 12166575824053 |
11 | 39708a79639a2 |
12 | 1445b69762931 |
13 | 6a33c3107a51 |
14 | 300c18993b37 |
15 | 161731d3a41d |
hex | b10c06e1cb5 |
12166575824053 has 24 divisors (see below), whose sum is σ = 14244200415072. Its totient is φ = 10361270765664.
The previous prime is 12166575824033. The next prime is 12166575824069. The reversal of 12166575824053 is 35042857566121.
It is a de Polignac number, because none of the positive numbers 2k-12166575824053 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12166575823985 and 12166575824003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12166575824023) 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 23 ways as a sum of consecutive naturals, for example, 113395050 + ... + 113502292.
It is an arithmetic number, because the mean of its divisors is an integer number (593508350628).
Almost surely, 212166575824053 is an apocalyptic number.
It is an amenable number.
12166575824053 is a deficient number, since it is larger than the sum of its proper divisors (2077624591019).
12166575824053 is a wasteful number, since it uses less digits than its factorization.
12166575824053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122161 (or 122154 counting only the distinct ones).
The product of its (nonzero) digits is 12096000, while the sum is 55.
The spelling of 12166575824053 in words is "twelve trillion, one hundred sixty-six billion, five hundred seventy-five million, eight hundred twenty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •