Base | Representation |
---|---|
bin | 1110110110100011010111… |
… | …10111110010101111100101 |
3 | 11021122100002012111120220111 |
4 | 13123101223313302233211 |
5 | 13240103144210403121 |
6 | 153244045355133021 |
7 | 6610442416545643 |
oct | 733215367625745 |
9 | 137570065446814 |
10 | 32660741106661 |
11 | a452384988938 |
12 | 37b5a54144171 |
13 | 152bb82790845 |
14 | 80cb0716c193 |
15 | 3b98aa4692e1 |
hex | 1db46bdf2be5 |
32660741106661 has 2 divisors, whose sum is σ = 32660741106662. Its totient is φ = 32660741106660.
The previous prime is 32660741106659. The next prime is 32660741106671. The reversal of 32660741106661 is 16660114706623.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27360588640225 + 5300152466436 = 5230735^2 + 2302206^2 .
It is a cyclic number.
It is not a de Polignac number, because 32660741106661 - 21 = 32660741106659 is a prime.
Together with 32660741106659, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32660741106671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16330370553330 + 16330370553331.
It is an arithmetic number, because the mean of its divisors is an integer number (16330370553331).
Almost surely, 232660741106661 is an apocalyptic number.
It is an amenable number.
32660741106661 is a deficient number, since it is larger than the sum of its proper divisors (1).
32660741106661 is an equidigital number, since it uses as much as digits as its factorization.
32660741106661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1306368, while the sum is 49.
The spelling of 32660741106661 in words is "thirty-two trillion, six hundred sixty billion, seven hundred forty-one million, one hundred six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •