Base | Representation |
---|---|
bin | 1011000101110111011100… |
… | …1100001001110000110001 |
3 | 1121011212111012220111012201 |
4 | 2301131313030021300301 |
5 | 3044302200411442021 |
6 | 41534254515423201 |
7 | 2366042450105041 |
oct | 261356714116061 |
9 | 47155435814181 |
10 | 12195411827761 |
11 | 3982055052318 |
12 | 144b6768b4b01 |
13 | 6a603a2a3236 |
14 | 3023925a1721 |
15 | 16236d68b591 |
hex | b1777309c31 |
12195411827761 has 2 divisors, whose sum is σ = 12195411827762. Its totient is φ = 12195411827760.
The previous prime is 12195411827759. The next prime is 12195411827783. The reversal of 12195411827761 is 16772811459121.
12195411827761 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9273431843361 + 2921979984400 = 3045231^2 + 1709380^2 .
It is a cyclic number.
It is not a de Polignac number, because 12195411827761 - 21 = 12195411827759 is a prime.
Together with 12195411827759, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (12195411822761) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6097705913880 + 6097705913881.
It is an arithmetic number, because the mean of its divisors is an integer number (6097705913881).
Almost surely, 212195411827761 is an apocalyptic number.
It is an amenable number.
12195411827761 is a deficient number, since it is larger than the sum of its proper divisors (1).
12195411827761 is an equidigital number, since it uses as much as digits as its factorization.
12195411827761 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1693440, while the sum is 55.
The spelling of 12195411827761 in words is "twelve trillion, one hundred ninety-five billion, four hundred eleven million, eight hundred twenty-seven thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •