Base | Representation |
---|---|
bin | 10010110011101… |
… | …00101000100101 |
3 | 101222212020201001 |
4 | 21121310220211 |
5 | 310341423013 |
6 | 23353233301 |
7 | 3623654512 |
oct | 1131645045 |
9 | 358766631 |
10 | 157764133 |
11 | 8106558a |
12 | 44a02831 |
13 | 268b9b77 |
14 | 16d4a309 |
15 | dcb4ddd |
hex | 9674a25 |
157764133 has 2 divisors, whose sum is σ = 157764134. Its totient is φ = 157764132.
The previous prime is 157764127. The next prime is 157764149. The reversal of 157764133 is 331467751.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 138815524 + 18948609 = 11782^2 + 4353^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-157764133 is a prime.
It is a super-2 number, since 2×1577641332 = 49779043322483378, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 157764092 and 157764101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (157764193) 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, 78882066 + 78882067.
It is an arithmetic number, because the mean of its divisors is an integer number (78882067).
Almost surely, 2157764133 is an apocalyptic number.
It is an amenable number.
157764133 is a deficient number, since it is larger than the sum of its proper divisors (1).
157764133 is an equidigital number, since it uses as much as digits as its factorization.
157764133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 52920, while the sum is 37.
The square root of 157764133 is about 12560.4193003259. The cubic root of 157764133 is about 540.3428698136.
The spelling of 157764133 in words is "one hundred fifty-seven million, seven hundred sixty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •