Base | Representation |
---|---|
bin | 1001011010011010111… |
… | …1000101111111101001 |
3 | 120110101221001201210202 |
4 | 2112212233011333221 |
5 | 10122141023400004 |
6 | 202142235121545 |
7 | 14453232056561 |
oct | 2264657057751 |
9 | 513357051722 |
10 | 161711153129 |
11 | 626438038a9 |
12 | 274108a32b5 |
13 | 1233191c876 |
14 | 7b80c9dda1 |
15 | 4316ce5b1e |
hex | 25a6bc5fe9 |
161711153129 has 2 divisors, whose sum is σ = 161711153130. Its totient is φ = 161711153128.
The previous prime is 161711153083. The next prime is 161711153143. The reversal of 161711153129 is 921351117161.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 139615817104 + 22095336025 = 373652^2 + 148645^2 .
It is an emirp because it is prime and its reverse (921351117161) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 161711153129 - 28 = 161711152873 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 161711153092 and 161711153101.
It is not a weakly prime, because it can be changed into another prime (161711153029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80855576564 + 80855576565.
It is an arithmetic number, because the mean of its divisors is an integer number (80855576565).
Almost surely, 2161711153129 is an apocalyptic number.
It is an amenable number.
161711153129 is a deficient number, since it is larger than the sum of its proper divisors (1).
161711153129 is an equidigital number, since it uses as much as digits as its factorization.
161711153129 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11340, while the sum is 38.
The spelling of 161711153129 in words is "one hundred sixty-one billion, seven hundred eleven million, one hundred fifty-three thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •