Base | Representation |
---|---|
bin | 10011011011111… |
… | …11110001100001 |
3 | 102100210221011201 |
4 | 21231333301201 |
5 | 313220141031 |
6 | 24102441201 |
7 | 4016632063 |
oct | 1155776141 |
9 | 370727151 |
10 | 163052641 |
11 | 84047954 |
12 | 46733201 |
13 | 27a1c06b |
14 | 17925733 |
15 | e4abd61 |
hex | 9b7fc61 |
163052641 has 2 divisors, whose sum is σ = 163052642. Its totient is φ = 163052640.
The previous prime is 163052629. The next prime is 163052657. The reversal of 163052641 is 146250361.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 160149025 + 2903616 = 12655^2 + 1704^2 .
It is an emirp because it is prime and its reverse (146250361) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 163052641 - 215 = 163019873 is a prime.
It is not a weakly prime, because it can be changed into another prime (163052671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 81526320 + 81526321.
It is an arithmetic number, because the mean of its divisors is an integer number (81526321).
Almost surely, 2163052641 is an apocalyptic number.
It is an amenable number.
163052641 is a deficient number, since it is larger than the sum of its proper divisors (1).
163052641 is an equidigital number, since it uses as much as digits as its factorization.
163052641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 28.
The square root of 163052641 is about 12769.2067490506. The cubic root of 163052641 is about 546.3143553772.
The spelling of 163052641 in words is "one hundred sixty-three million, fifty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •