Base | Representation |
---|---|
bin | 10010101110100… |
… | …11100000000011 |
3 | 101221121201100112 |
4 | 21113103200003 |
5 | 310204313011 |
6 | 23331141535 |
7 | 3615235352 |
oct | 1127234003 |
9 | 357551315 |
10 | 157104131 |
11 | 80754728 |
12 | 447448ab |
13 | 26718632 |
14 | 16c17999 |
15 | dbd458b |
hex | 95d3803 |
157104131 has 2 divisors, whose sum is σ = 157104132. Its totient is φ = 157104130.
The previous prime is 157104113. The next prime is 157104133. The reversal of 157104131 is 131401751.
It is a happy number.
Together with previous prime (157104113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 157104131 - 26 = 157104067 is a prime.
It is a super-2 number, since 2×1571041312 = 49363415954530322, which contains 22 as substring.
Together with 157104133, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 157104097 and 157104106.
It is not a weakly prime, because it can be changed into another prime (157104133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 78552065 + 78552066.
It is an arithmetic number, because the mean of its divisors is an integer number (78552066).
Almost surely, 2157104131 is an apocalyptic number.
157104131 is a deficient number, since it is larger than the sum of its proper divisors (1).
157104131 is an equidigital number, since it uses as much as digits as its factorization.
157104131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 420, while the sum is 23.
The square root of 157104131 is about 12534.1186766362. The cubic root of 157104131 is about 539.5883133317.
Adding to 157104131 its reverse (131401751), we get a palindrome (288505882).
The spelling of 157104131 in words is "one hundred fifty-seven million, one hundred four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •