Base | Representation |
---|---|
bin | 1001101011011100111001… |
… | …0111001001001100011101 |
3 | 1101200101002222110002112022 |
4 | 2122313032113021030131 |
5 | 2343330003104300121 |
6 | 34344524514145525 |
7 | 2145603030610262 |
oct | 232671627111435 |
9 | 41611088402468 |
10 | 10642096165661 |
11 | 3433318934974 |
12 | 123a6145822a5 |
13 | 5c2712212a9c |
14 | 28b11a10d269 |
15 | 136c5a803aab |
hex | 9adce5c931d |
10642096165661 has 2 divisors, whose sum is σ = 10642096165662. Its totient is φ = 10642096165660.
The previous prime is 10642096165531. The next prime is 10642096165663. The reversal of 10642096165661 is 16656169024601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7247267805625 + 3394828360036 = 2692075^2 + 1842506^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10642096165661 is a prime.
It is a super-2 number, since 2×106420961656612 (a number of 27 digits) contains 22 as substring.
Together with 10642096165663, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10642096165663) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5321048082830 + 5321048082831.
It is an arithmetic number, because the mean of its divisors is an integer number (5321048082831).
Almost surely, 210642096165661 is an apocalyptic number.
It is an amenable number.
10642096165661 is a deficient number, since it is larger than the sum of its proper divisors (1).
10642096165661 is an equidigital number, since it uses as much as digits as its factorization.
10642096165661 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2799360, while the sum is 53.
The spelling of 10642096165661 in words is "ten trillion, six hundred forty-two billion, ninety-six million, one hundred sixty-five thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •