Base | Representation |
---|---|
bin | 1001001000111111111… |
… | …1111111111111110101 |
3 | 120000100000120102101021 |
4 | 2102033333333333311 |
5 | 10033101343213444 |
6 | 200050223301141 |
7 | 14226316165264 |
oct | 2221777777765 |
9 | 500300512337 |
10 | 157034741749 |
11 | 60664021806 |
12 | 2652674a7b1 |
13 | 11a67b2a742 |
14 | 7859b925db |
15 | 41414ac584 |
hex | 248ffffff5 |
157034741749 has 2 divisors, whose sum is σ = 157034741750. Its totient is φ = 157034741748.
The previous prime is 157034741737. The next prime is 157034741861. The reversal of 157034741749 is 947147430751.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 143806291524 + 13228450225 = 379218^2 + 115015^2 .
It is an emirp because it is prime and its reverse (947147430751) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 157034741749 - 221 = 157032644597 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 157034741696 and 157034741705.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (157034744749) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 78517370874 + 78517370875.
It is an arithmetic number, because the mean of its divisors is an integer number (78517370875).
Almost surely, 2157034741749 is an apocalyptic number.
It is an amenable number.
157034741749 is a deficient number, since it is larger than the sum of its proper divisors (1).
157034741749 is an equidigital number, since it uses as much as digits as its factorization.
157034741749 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2963520, while the sum is 52.
The spelling of 157034741749 in words is "one hundred fifty-seven billion, thirty-four million, seven hundred forty-one thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •