Base | Representation |
---|---|
bin | 1001011111110110101… |
… | …0101101111111110101 |
3 | 120121011120102201210101 |
4 | 2113331222231333311 |
5 | 10133132410432203 |
6 | 202543055154101 |
7 | 14534331630442 |
oct | 2277552557765 |
9 | 517146381711 |
10 | 163169624053 |
11 | 63221aa9677 |
12 | 27759215931 |
13 | 12504b31307 |
14 | 7c7c8729c9 |
15 | 439ed8a41d |
hex | 25fdaadff5 |
163169624053 has 2 divisors, whose sum is σ = 163169624054. Its totient is φ = 163169624052.
The previous prime is 163169624047. The next prime is 163169624071. The reversal of 163169624053 is 350426961361.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 133095821329 + 30073802724 = 364823^2 + 173418^2 .
It is an emirp because it is prime and its reverse (350426961361) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 163169624053 - 29 = 163169623541 is a prime.
It is a super-2 number, since 2×1631696240532 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 163169623994 and 163169624012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (163169624083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 81584812026 + 81584812027.
It is an arithmetic number, because the mean of its divisors is an integer number (81584812027).
Almost surely, 2163169624053 is an apocalyptic number.
It is an amenable number.
163169624053 is a deficient number, since it is larger than the sum of its proper divisors (1).
163169624053 is an equidigital number, since it uses as much as digits as its factorization.
163169624053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 699840, while the sum is 46.
The spelling of 163169624053 in words is "one hundred sixty-three billion, one hundred sixty-nine million, six hundred twenty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •