Base | Representation |
---|---|
bin | 111110001011101000… |
… | …001011000000111101 |
3 | 20101100010000202020012 |
4 | 332023220023000331 |
5 | 2043214332321331 |
6 | 50401122033005 |
7 | 4552356521333 |
oct | 761350130075 |
9 | 211303022205 |
10 | 66767073341 |
11 | 263522aa461 |
12 | 10b341a8765 |
13 | 63b071a9b7 |
14 | 33354d9b53 |
15 | 1b0b8ab82b |
hex | f8ba0b03d |
66767073341 has 2 divisors, whose sum is σ = 66767073342. Its totient is φ = 66767073340.
The previous prime is 66767073301. The next prime is 66767073343. The reversal of 66767073341 is 14337076766.
66767073341 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., 33705288100 + 33061785241 = 183590^2 + 181829^2 .
It is a cyclic number.
It is not a de Polignac number, because 66767073341 - 26 = 66767073277 is a prime.
Together with 66767073343, 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 66767073341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (66767073343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33383536670 + 33383536671.
It is an arithmetic number, because the mean of its divisors is an integer number (33383536671).
Almost surely, 266767073341 is an apocalyptic number.
It is an amenable number.
66767073341 is a deficient number, since it is larger than the sum of its proper divisors (1).
66767073341 is an equidigital number, since it uses as much as digits as its factorization.
66767073341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2667168, while the sum is 50.
The spelling of 66767073341 in words is "sixty-six billion, seven hundred sixty-seven million, seventy-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •