Base | Representation |
---|---|
bin | 100101001010000110101110… |
… | …110010001011010100001101 |
3 | 210102122000010010120101210211 |
4 | 211022012232302023110031 |
5 | 132410002022104102022 |
6 | 1335323032431002421 |
7 | 46264601023134304 |
oct | 4512065662132415 |
9 | 712560103511724 |
10 | 163422143034637 |
11 | 48086a3a377a83 |
12 | 163b4381069411 |
13 | 7025846515006 |
14 | 2c4d96137943b |
15 | 13d5eb9443e77 |
hex | 94a1aec8b50d |
163422143034637 has 2 divisors, whose sum is σ = 163422143034638. Its totient is φ = 163422143034636.
The previous prime is 163422143034617. The next prime is 163422143034641. The reversal of 163422143034637 is 736430341224361.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 148111309669801 + 15310833364836 = 12170099^2 + 3912906^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-163422143034637 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (163422143034617) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 81711071517318 + 81711071517319.
It is an arithmetic number, because the mean of its divisors is an integer number (81711071517319).
Almost surely, 2163422143034637 is an apocalyptic number.
It is an amenable number.
163422143034637 is a deficient number, since it is larger than the sum of its proper divisors (1).
163422143034637 is an equidigital number, since it uses as much as digits as its factorization.
163422143034637 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5225472, while the sum is 49.
Adding to 163422143034637 its reverse (736430341224361), we get a palindrome (899852484258998).
The spelling of 163422143034637 in words is "one hundred sixty-three trillion, four hundred twenty-two billion, one hundred forty-three million, thirty-four thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •