Base | Representation |
---|---|
bin | 10010110010101… |
… | …00000101011101 |
3 | 101222121110211021 |
4 | 21121110011131 |
5 | 310323141223 |
6 | 23350324141 |
7 | 3622561024 |
oct | 1131240535 |
9 | 358543737 |
10 | 157630813 |
11 | 80a843aa |
12 | 44959651 |
13 | 26871292 |
14 | 16d138bb |
15 | dc8a65d |
hex | 965415d |
157630813 has 2 divisors, whose sum is σ = 157630814. Its totient is φ = 157630812.
The previous prime is 157630793. The next prime is 157630829. The reversal of 157630813 is 318036751.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 155077209 + 2553604 = 12453^2 + 1598^2 .
It is an emirp because it is prime and its reverse (318036751) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 157630813 - 29 = 157630301 is a prime.
It is a super-3 number, since 3×1576308133 (a number of 26 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (157630873) 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, 78815406 + 78815407.
It is an arithmetic number, because the mean of its divisors is an integer number (78815407).
Almost surely, 2157630813 is an apocalyptic number.
It is an amenable number.
157630813 is a deficient number, since it is larger than the sum of its proper divisors (1).
157630813 is an equidigital number, since it uses as much as digits as its factorization.
157630813 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 34.
The square root of 157630813 is about 12555.1110309706. Note that the first 3 decimals coincide. The cubic root of 157630813 is about 540.1906197176.
The spelling of 157630813 in words is "one hundred fifty-seven million, six hundred thirty thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •