Base | Representation |
---|---|
bin | 10010101110011… |
… | …00011110110101 |
3 | 101221120020220201 |
4 | 21113030132311 |
5 | 310202403011 |
6 | 23330400501 |
7 | 3615055501 |
oct | 1127143665 |
9 | 357506821 |
10 | 157075381 |
11 | 80735071 |
12 | 44730131 |
13 | 26708518 |
14 | 16c0b301 |
15 | dbcacc1 |
hex | 95cc7b5 |
157075381 has 2 divisors, whose sum is σ = 157075382. Its totient is φ = 157075380.
The previous prime is 157075379. The next prime is 157075409. The reversal of 157075381 is 183570751.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 90897156 + 66178225 = 9534^2 + 8135^2 .
It is a cyclic number.
It is not a de Polignac number, because 157075381 - 21 = 157075379 is a prime.
It is a super-2 number, since 2×1570753812 = 49345350632590322, which contains 22 as substring.
Together with 157075379, 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 157075381.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (157075351) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 78537690 + 78537691.
It is an arithmetic number, because the mean of its divisors is an integer number (78537691).
Almost surely, 2157075381 is an apocalyptic number.
It is an amenable number.
157075381 is a deficient number, since it is larger than the sum of its proper divisors (1).
157075381 is an equidigital number, since it uses as much as digits as its factorization.
157075381 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 29400, while the sum is 37.
The square root of 157075381 is about 12532.9717545361. The cubic root of 157075381 is about 539.5553965007. Note that the first 3 decimals are identical.
The spelling of 157075381 in words is "one hundred fifty-seven million, seventy-five thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •