Base | Representation |
---|---|
bin | 1001001000111011011… |
… | …1100100001111011101 |
3 | 120000021200211201122221 |
4 | 2102032313210033131 |
5 | 10033032013104233 |
6 | 200044304305341 |
7 | 14225665612441 |
oct | 2221667441735 |
9 | 500250751587 |
10 | 157015753693 |
11 | 606543327a7 |
12 | 26520312251 |
13 | 11a63c0cac6 |
14 | 785744c821 |
15 | 413e9ab42d |
hex | 248ede43dd |
157015753693 has 2 divisors, whose sum is σ = 157015753694. Its totient is φ = 157015753692.
The previous prime is 157015753691. The next prime is 157015753729. The reversal of 157015753693 is 396357510751.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 152683218009 + 4332535684 = 390747^2 + 65822^2 .
It is an emirp because it is prime and its reverse (396357510751) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 157015753693 - 21 = 157015753691 is a prime.
Together with 157015753691, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 157015753693.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (157015753691) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 78507876846 + 78507876847.
It is an arithmetic number, because the mean of its divisors is an integer number (78507876847).
Almost surely, 2157015753693 is an apocalyptic number.
It is an amenable number.
157015753693 is a deficient number, since it is larger than the sum of its proper divisors (1).
157015753693 is an equidigital number, since it uses as much as digits as its factorization.
157015753693 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2976750, while the sum is 52.
The spelling of 157015753693 in words is "one hundred fifty-seven billion, fifteen million, seven hundred fifty-three thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •