Base | Representation |
---|---|
bin | 1001001011010101111… |
… | …1110111110100100101 |
3 | 120001221212100121221212 |
4 | 2102311133313310211 |
5 | 10040343421310421 |
6 | 200232455321205 |
7 | 14251025434343 |
oct | 2226537676445 |
9 | 501855317855 |
10 | 157663853861 |
11 | 60957153a78 |
12 | 26681380205 |
13 | 11b3827a127 |
14 | 78b9556993 |
15 | 417b82ae5b |
hex | 24b57f7d25 |
157663853861 has 2 divisors, whose sum is σ = 157663853862. Its totient is φ = 157663853860.
The previous prime is 157663853857. The next prime is 157663853863. The reversal of 157663853861 is 168358366751.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 157385964961 + 277888900 = 396719^2 + 16670^2 .
It is a cyclic number.
It is not a de Polignac number, because 157663853861 - 22 = 157663853857 is a prime.
Together with 157663853863, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 157663853861.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (157663853863) 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, 78831926930 + 78831926931.
It is an arithmetic number, because the mean of its divisors is an integer number (78831926931).
Almost surely, 2157663853861 is an apocalyptic number.
It is an amenable number.
157663853861 is a deficient number, since it is larger than the sum of its proper divisors (1).
157663853861 is an equidigital number, since it uses as much as digits as its factorization.
157663853861 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 21772800, while the sum is 59.
The spelling of 157663853861 in words is "one hundred fifty-seven billion, six hundred sixty-three million, eight hundred fifty-three thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •