Base | Representation |
---|---|
bin | 110000101101110100101011… |
… | …101101000011010000100101 |
3 | 1001002121121001122201002210001 |
4 | 300231310223231003100211 |
5 | 211040324100224303302 |
6 | 2035403245220501301 |
7 | 63062266004634322 |
oct | 6055645355032045 |
9 | 1032547048632701 |
10 | 214255176791077 |
11 | 622a512374aa14 |
12 | 2004410924a831 |
13 | 927223a94c9a6 |
14 | 3aca012225b49 |
15 | 19b84074d0787 |
hex | c2dd2bb43425 |
214255176791077 has 2 divisors, whose sum is σ = 214255176791078. Its totient is φ = 214255176791076.
The previous prime is 214255176791011. The next prime is 214255176791099. The reversal of 214255176791077 is 770197671552412.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 182725536795201 + 31529639995876 = 13517601^2 + 5615126^2 .
It is a cyclic number.
It is not a de Polignac number, because 214255176791077 - 223 = 214255168402469 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (214255176491077) 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 as a sum of consecutive naturals, namely, 107127588395538 + 107127588395539.
It is an arithmetic number, because the mean of its divisors is an integer number (107127588395539).
Almost surely, 2214255176791077 is an apocalyptic number.
It is an amenable number.
214255176791077 is a deficient number, since it is larger than the sum of its proper divisors (1).
214255176791077 is an equidigital number, since it uses as much as digits as its factorization.
214255176791077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51861600, while the sum is 64.
The spelling of 214255176791077 in words is "two hundred fourteen trillion, two hundred fifty-five billion, one hundred seventy-six million, seven hundred ninety-one thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •