Base | Representation |
---|---|
bin | 11101111010001001… |
… | …11110100100001101 |
3 | 1112110001021020001001 |
4 | 32331010332210031 |
5 | 230341104204212 |
6 | 11213155220301 |
7 | 1105624050151 |
oct | 167504764415 |
9 | 45401236031 |
10 | 16057100557 |
11 | 689a8a6343 |
12 | 31415a7691 |
13 | 168b859544 |
14 | ac4797061 |
15 | 63ea24657 |
hex | 3bd13e90d |
16057100557 has 2 divisors, whose sum is σ = 16057100558. Its totient is φ = 16057100556.
The previous prime is 16057100531. The next prime is 16057100581. The reversal of 16057100557 is 75500175061.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13598824996 + 2458275561 = 116614^2 + 49581^2 .
It is a cyclic number.
It is not a de Polignac number, because 16057100557 - 219 = 16056576269 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16057200557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8028550278 + 8028550279.
It is an arithmetic number, because the mean of its divisors is an integer number (8028550279).
Almost surely, 216057100557 is an apocalyptic number.
It is an amenable number.
16057100557 is a deficient number, since it is larger than the sum of its proper divisors (1).
16057100557 is an equidigital number, since it uses as much as digits as its factorization.
16057100557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36750, while the sum is 37.
The spelling of 16057100557 in words is "sixteen billion, fifty-seven million, one hundred thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •