Base | Representation |
---|---|
bin | 10011011011001101001… |
… | …10010001001101001101 |
3 | 2100210210010102221221202 |
4 | 21231212212101031031 |
5 | 41413404424120421 |
6 | 1230341314035245 |
7 | 66135546631445 |
oct | 11554646211515 |
9 | 2323703387852 |
10 | 667441238861 |
11 | 2380731a7541 |
12 | a9430878b25 |
13 | 4ac29c405c7 |
14 | 24439111125 |
15 | 125659e710b |
hex | 9b6699134d |
667441238861 has 2 divisors, whose sum is σ = 667441238862. Its totient is φ = 667441238860.
The previous prime is 667441238803. The next prime is 667441238869. The reversal of 667441238861 is 168832144766.
667441238861 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., 553015322500 + 114425916361 = 743650^2 + 338269^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-667441238861 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 667441238797 and 667441238806.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (667441238869) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 333720619430 + 333720619431.
It is an arithmetic number, because the mean of its divisors is an integer number (333720619431).
Almost surely, 2667441238861 is an apocalyptic number.
It is an amenable number.
667441238861 is a deficient number, since it is larger than the sum of its proper divisors (1).
667441238861 is an equidigital number, since it uses as much as digits as its factorization.
667441238861 is an evil number, because the sum of its binary digits is even.
The product of its digits is 9289728, while the sum is 56.
The spelling of 667441238861 in words is "six hundred sixty-seven billion, four hundred forty-one million, two hundred thirty-eight thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •