Base | Representation |
---|---|
bin | 1001001000111100100… |
… | …0001101010011000001 |
3 | 120000022000001100211211 |
4 | 2102033020031103001 |
5 | 10033034122204121 |
6 | 200044542010121 |
7 | 14226050652136 |
oct | 2221710152301 |
9 | 500260040754 |
10 | 157020116161 |
11 | 60656842347 |
12 | 26521876941 |
13 | 11a64aa964c |
14 | 7857c6658d |
15 | 414006dce1 |
hex | 248f20d4c1 |
157020116161 has 2 divisors, whose sum is σ = 157020116162. Its totient is φ = 157020116160.
The previous prime is 157020116131. The next prime is 157020116173. The reversal of 157020116161 is 161611020751.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97496315536 + 59523800625 = 312244^2 + 243975^2 .
It is a cyclic number.
It is not a de Polignac number, because 157020116161 - 29 = 157020115649 is a prime.
It is not a weakly prime, because it can be changed into another prime (157020116111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 78510058080 + 78510058081.
It is an arithmetic number, because the mean of its divisors is an integer number (78510058081).
Almost surely, 2157020116161 is an apocalyptic number.
It is an amenable number.
157020116161 is a deficient number, since it is larger than the sum of its proper divisors (1).
157020116161 is an equidigital number, since it uses as much as digits as its factorization.
157020116161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 31.
The spelling of 157020116161 in words is "one hundred fifty-seven billion, twenty million, one hundred sixteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •