Base | Representation |
---|---|
bin | 10010110100110… |
… | …00100010100001 |
3 | 102000010201110000 |
4 | 21122120202201 |
5 | 310411124301 |
6 | 23400330213 |
7 | 3625136340 |
oct | 1132304241 |
9 | 360121400 |
10 | 157911201 |
11 | 81156028 |
12 | 44a73969 |
13 | 2693baa6 |
14 | 16d87b57 |
15 | dce3786 |
hex | 96988a1 |
157911201 has 20 divisors (see below), whose sum is σ = 269591872. Its totient is φ = 90234648.
The previous prime is 157911197. The next prime is 157911209. The reversal of 157911201 is 102119751.
It is not a de Polignac number, because 157911201 - 22 = 157911197 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (157911209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 138685 + ... + 139818.
Almost surely, 2157911201 is an apocalyptic number.
It is an amenable number.
157911201 is a deficient number, since it is larger than the sum of its proper divisors (111680671).
157911201 is an equidigital number, since it uses as much as digits as its factorization.
157911201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278522 (or 278513 counting only the distinct ones).
The product of its (nonzero) digits is 630, while the sum is 27.
The square root of 157911201 is about 12566.2723589774. The cubic root of 157911201 is about 540.5107205228.
The spelling of 157911201 in words is "one hundred fifty-seven million, nine hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •