Base | Representation |
---|---|
bin | 1001010110000010011… |
… | …0010111101100100101 |
3 | 120100100220220120221222 |
4 | 2111200212113230211 |
5 | 10112233310224341 |
6 | 201425402350125 |
7 | 14412123256121 |
oct | 2254046275445 |
9 | 510326816858 |
10 | 160534461221 |
11 | 6209a577852 |
12 | 271427bb345 |
13 | 121a4bc9474 |
14 | 7aac8ba581 |
15 | 429886144b |
hex | 2560997b25 |
160534461221 has 2 divisors, whose sum is σ = 160534461222. Its totient is φ = 160534461220.
The previous prime is 160534461193. The next prime is 160534461223. The reversal of 160534461221 is 122164435061.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110100530596 + 50433930625 = 331814^2 + 224575^2 .
It is an emirp because it is prime and its reverse (122164435061) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-160534461221 is a prime.
Together with 160534461223, 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 (160534461223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80267230610 + 80267230611.
It is an arithmetic number, because the mean of its divisors is an integer number (80267230611).
Almost surely, 2160534461221 is an apocalyptic number.
It is an amenable number.
160534461221 is a deficient number, since it is larger than the sum of its proper divisors (1).
160534461221 is an equidigital number, since it uses as much as digits as its factorization.
160534461221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34560, while the sum is 35.
Adding to 160534461221 its reverse (122164435061), we get a palindrome (282698896282).
The spelling of 160534461221 in words is "one hundred sixty billion, five hundred thirty-four million, four hundred sixty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •