Base | Representation |
---|---|
bin | 10010101110100… |
… | …11010111110101 |
3 | 101221121200122001 |
4 | 21113103113311 |
5 | 310204303410 |
6 | 23331135301 |
7 | 3615234001 |
oct | 1127232765 |
9 | 357550561 |
10 | 157103605 |
11 | 8075429a |
12 | 44744531 |
13 | 26718319 |
14 | 16c17701 |
15 | dbd433a |
hex | 95d35f5 |
157103605 has 4 divisors (see below), whose sum is σ = 188524332. Its totient is φ = 125682880.
The previous prime is 157103603. The next prime is 157103621. The reversal of 157103605 is 506301751.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 506301751 = 1109 ⋅456539.
It can be written as a sum of positive squares in 2 ways, for example, as 43744996 + 113358609 = 6614^2 + 10647^2 .
It is not a de Polignac number, because 157103605 - 21 = 157103603 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (157103603) 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 3 ways as a sum of consecutive naturals, for example, 15710356 + ... + 15710365.
It is an arithmetic number, because the mean of its divisors is an integer number (47131083).
Almost surely, 2157103605 is an apocalyptic number.
It is an amenable number.
157103605 is a deficient number, since it is larger than the sum of its proper divisors (31420727).
157103605 is an equidigital number, since it uses as much as digits as its factorization.
157103605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31420726.
The product of its (nonzero) digits is 3150, while the sum is 28.
The square root of 157103605 is about 12534.0976938909. The cubic root of 157103605 is about 539.5877111329.
The spelling of 157103605 in words is "one hundred fifty-seven million, one hundred three thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •