Base | Representation |
---|---|
bin | 10010101111101… |
… | …01011100011101 |
3 | 101221212210001221 |
4 | 21113311130131 |
5 | 310223240130 |
6 | 23334133341 |
7 | 3616354612 |
oct | 1127653435 |
9 | 357783057 |
10 | 157243165 |
11 | 8083a132 |
12 | 447b1251 |
13 | 267669c1 |
14 | 16c52509 |
15 | dc1087a |
hex | 95f571d |
157243165 has 8 divisors (see below), whose sum is σ = 188762040. Its totient is φ = 125747712.
The previous prime is 157243117. The next prime is 157243169. The reversal of 157243165 is 561342751.
It can be written as a sum of positive squares in 4 ways, for example, as 34609689 + 122633476 = 5883^2 + 11074^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 157243165 - 29 = 157242653 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 157243165.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (157243169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17121 + ... + 24649.
It is an arithmetic number, because the mean of its divisors is an integer number (23595255).
Almost surely, 2157243165 is an apocalyptic number.
It is an amenable number.
157243165 is a deficient number, since it is larger than the sum of its proper divisors (31518875).
157243165 is an equidigital number, since it uses as much as digits as its factorization.
157243165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11711.
The product of its digits is 25200, while the sum is 34.
The square root of 157243165 is about 12539.6636717258. The cubic root of 157243165 is about 539.7474413386.
The spelling of 157243165 in words is "one hundred fifty-seven million, two hundred forty-three thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •