Base | Representation |
---|---|
bin | 1001001011011010000… |
… | …1010010001001011101 |
3 | 120002000001121210111001 |
4 | 2102312201102021131 |
5 | 10040412314013203 |
6 | 200234311030301 |
7 | 14251324252222 |
oct | 2226641221135 |
9 | 502001553431 |
10 | 157681001053 |
11 | 609658a5a04 |
12 | 2668706b391 |
13 | 11b3b9a1bb4 |
14 | 78bb93b949 |
15 | 417d0b691d |
hex | 24b685225d |
157681001053 has 2 divisors, whose sum is σ = 157681001054. Its totient is φ = 157681001052.
The previous prime is 157681001047. The next prime is 157681001063. The reversal of 157681001053 is 350100186751.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 85566195289 + 72114805764 = 292517^2 + 268542^2 .
It is a cyclic number.
It is not a de Polignac number, because 157681001053 - 25 = 157681001021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (157681001003) 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, 78840500526 + 78840500527.
It is an arithmetic number, because the mean of its divisors is an integer number (78840500527).
Almost surely, 2157681001053 is an apocalyptic number.
It is an amenable number.
157681001053 is a deficient number, since it is larger than the sum of its proper divisors (1).
157681001053 is an equidigital number, since it uses as much as digits as its factorization.
157681001053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25200, while the sum is 37.
The spelling of 157681001053 in words is "one hundred fifty-seven billion, six hundred eighty-one million, one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.864 sec. • engine limits •