Base | Representation |
---|---|
bin | 10011011100111100000100… |
… | …11000001001110100110001 |
3 | 12121110022201201121220212012 |
4 | 21232132002120021310301 |
5 | 21101314232231430031 |
6 | 230550525501212305 |
7 | 12003306242332604 |
oct | 1156360230116461 |
9 | 177408651556765 |
10 | 42775766670641 |
11 | 126a211213a624 |
12 | 496a291861095 |
13 | 1ab3978355654 |
14 | a7c502ab833b |
15 | 4e2a687aab2b |
hex | 26e782609d31 |
42775766670641 has 2 divisors, whose sum is σ = 42775766670642. Its totient is φ = 42775766670640.
The previous prime is 42775766670629. The next prime is 42775766670643. The reversal of 42775766670641 is 14607666757724.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 39902012774416 + 2873753896225 = 6316804^2 + 1695215^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42775766670641 is a prime.
It is a super-2 number, since 2×427757666706412 (a number of 28 digits) contains 22 as substring.
Together with 42775766670643, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (42775766670643) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21387883335320 + 21387883335321.
It is an arithmetic number, because the mean of its divisors is an integer number (21387883335321).
Almost surely, 242775766670641 is an apocalyptic number.
It is an amenable number.
42775766670641 is a deficient number, since it is larger than the sum of its proper divisors (1).
42775766670641 is an equidigital number, since it uses as much as digits as its factorization.
42775766670641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 497871360, while the sum is 68.
The spelling of 42775766670641 in words is "forty-two trillion, seven hundred seventy-five billion, seven hundred sixty-six million, six hundred seventy thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •