Base | Representation |
---|---|
bin | 10010110010101… |
… | …00001001011101 |
3 | 101222121111011202 |
4 | 21121110021131 |
5 | 310323143234 |
6 | 23350325245 |
7 | 3622561541 |
oct | 1131241135 |
9 | 358544152 |
10 | 157631069 |
11 | 80a84612 |
12 | 44959825 |
13 | 2687142b |
14 | 16d13a21 |
15 | dc8a77e |
hex | 965425d |
157631069 has 2 divisors, whose sum is σ = 157631070. Its totient is φ = 157631068.
The previous prime is 157631057. The next prime is 157631081. The reversal of 157631069 is 960136751.
It is a balanced prime because it is at equal distance from previous prime (157631057) and next prime (157631081).
It can be written as a sum of positive squares in only one way, i.e., 86025625 + 71605444 = 9275^2 + 8462^2 .
It is a cyclic number.
It is not a de Polignac number, because 157631069 - 28 = 157630813 is a prime.
It is a super-2 number, since 2×1576310692 = 49695107828165522, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (157631099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 78815534 + 78815535.
It is an arithmetic number, because the mean of its divisors is an integer number (78815535).
Almost surely, 2157631069 is an apocalyptic number.
It is an amenable number.
157631069 is a deficient number, since it is larger than the sum of its proper divisors (1).
157631069 is an equidigital number, since it uses as much as digits as its factorization.
157631069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34020, while the sum is 38.
The square root of 157631069 is about 12555.1212260177. The cubic root of 157631069 is about 540.1909121493.
The spelling of 157631069 in words is "one hundred fifty-seven million, six hundred thirty-one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •