Base | Representation |
---|---|
bin | 10010101110110… |
… | …11001110100001 |
3 | 101221200022202121 |
4 | 21113123032201 |
5 | 310211321102 |
6 | 23331544241 |
7 | 3615426541 |
oct | 1127331641 |
9 | 357608677 |
10 | 157135777 |
11 | 80776487 |
12 | 4475b081 |
13 | 26729b66 |
14 | 16c25321 |
15 | dbddb37 |
hex | 95db3a1 |
157135777 has 4 divisors (see below), whose sum is σ = 166379076. Its totient is φ = 147892480.
The previous prime is 157135763. The next prime is 157135843. The reversal of 157135777 is 777531751.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 777531751 = 313 ⋅2484127.
It can be written as a sum of positive squares in 2 ways, for example, as 146870161 + 10265616 = 12119^2 + 3204^2 .
It is a cyclic number.
It is not a de Polignac number, because 157135777 - 219 = 156611489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (157130777) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4621624 + ... + 4621657.
It is an arithmetic number, because the mean of its divisors is an integer number (41594769).
Almost surely, 2157135777 is an apocalyptic number.
157135777 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
157135777 is a deficient number, since it is larger than the sum of its proper divisors (9243299).
157135777 is an equidigital number, since it uses as much as digits as its factorization.
157135777 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9243298.
The product of its digits is 180075, while the sum is 43.
The square root of 157135777 is about 12535.3810073727. The cubic root of 157135777 is about 539.6245412468.
The spelling of 157135777 in words is "one hundred fifty-seven million, one hundred thirty-five thousand, seven hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •