Base | Representation |
---|---|
bin | 1100010100010111111111100… |
… | …1101001111110101101010101 |
3 | 11012200011212222000221012211012 |
4 | 3011011333321221332231111 |
5 | 1402104044430004042044 |
6 | 12311330555304422005 |
7 | 350404132244630411 |
oct | 30505777151765525 |
9 | 4180155860835735 |
10 | 866827373112149 |
11 | 23121a473a84879 |
12 | 81278b51477905 |
13 | 2b28a616a20007 |
14 | 1140a950d47d41 |
15 | 6a3328127159e |
hex | 3145ff9a7eb55 |
866827373112149 has 2 divisors, whose sum is σ = 866827373112150. Its totient is φ = 866827373112148.
The previous prime is 866827373112133. The next prime is 866827373112187. The reversal of 866827373112149 is 941211373728668.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 446673430622500 + 420153942489649 = 21134650^2 + 20497657^2 .
It is a cyclic number.
It is not a de Polignac number, because 866827373112149 - 24 = 866827373112133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (866827373117149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 433413686556074 + 433413686556075.
It is an arithmetic number, because the mean of its divisors is an integer number (433413686556075).
Almost surely, 2866827373112149 is an apocalyptic number.
It is an amenable number.
866827373112149 is a deficient number, since it is larger than the sum of its proper divisors (1).
866827373112149 is an equidigital number, since it uses as much as digits as its factorization.
866827373112149 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 146313216, while the sum is 68.
The spelling of 866827373112149 in words is "eight hundred sixty-six trillion, eight hundred twenty-seven billion, three hundred seventy-three million, one hundred twelve thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •