Base | Representation |
---|---|
bin | 1011001101110011000001… |
… | …1110010101011000001111 |
3 | 1121122220011220002112120110 |
4 | 2303130300132111120033 |
5 | 3104020222034140241 |
6 | 42121031032251103 |
7 | 2411635065421122 |
oct | 263346036253017 |
9 | 47586156075513 |
10 | 12331664365071 |
11 | 3a24914059257 |
12 | 1471b61540a93 |
13 | 6b5b4266408c |
14 | 308bda2163b9 |
15 | 165b953bd816 |
hex | b373079560f |
12331664365071 has 8 divisors (see below), whose sum is σ = 16886603455024. Its totient is φ = 7998917425920.
The previous prime is 12331664365063. The next prime is 12331664365093. The reversal of 12331664365071 is 17056346613321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12331664365071 - 23 = 12331664365063 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12331664365071.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12331664365051) 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 7 ways as a sum of consecutive naturals, for example, 55548037570 + ... + 55548037791.
It is an arithmetic number, because the mean of its divisors is an integer number (2110825431878).
Almost surely, 212331664365071 is an apocalyptic number.
12331664365071 is a deficient number, since it is larger than the sum of its proper divisors (4554939089953).
12331664365071 is a wasteful number, since it uses less digits than its factorization.
12331664365071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111096075401.
The product of its (nonzero) digits is 1632960, while the sum is 48.
The spelling of 12331664365071 in words is "twelve trillion, three hundred thirty-one billion, six hundred sixty-four million, three hundred sixty-five thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •