Base | Representation |
---|---|
bin | 111101100110101100… |
… | …001011010100000101 |
3 | 20022201220221100202222 |
4 | 331212230023110011 |
5 | 2040432211204044 |
6 | 50215423342125 |
7 | 4531123222664 |
oct | 754654132405 |
9 | 208656840688 |
10 | 66147366149 |
11 | 26064511257 |
12 | 109a0751945 |
13 | 6312212057 |
14 | 32b70a2ddb |
15 | 1ac22998ee |
hex | f66b0b505 |
66147366149 has 2 divisors, whose sum is σ = 66147366150. Its totient is φ = 66147366148.
The previous prime is 66147366079. The next prime is 66147366151. The reversal of 66147366149 is 94166374166.
66147366149 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 64659335524 + 1488030625 = 254282^2 + 38575^2 .
It is a cyclic number.
It is not a de Polignac number, because 66147366149 - 212 = 66147362053 is a prime.
Together with 66147366151, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 66147366149.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (66147366449) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33073683074 + 33073683075.
It is an arithmetic number, because the mean of its divisors is an integer number (33073683075).
Almost surely, 266147366149 is an apocalyptic number.
It is an amenable number.
66147366149 is a deficient number, since it is larger than the sum of its proper divisors (1).
66147366149 is an equidigital number, since it uses as much as digits as its factorization.
66147366149 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3919104, while the sum is 53.
The spelling of 66147366149 in words is "sixty-six billion, one hundred forty-seven million, three hundred sixty-six thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •