Base | Representation |
---|---|
bin | 10010101101111… |
… | …00101010101101 |
3 | 101221102222001121 |
4 | 21112330222231 |
5 | 310143314410 |
6 | 23325140541 |
7 | 3614365603 |
oct | 1126745255 |
9 | 357388047 |
10 | 157010605 |
11 | 806a0434 |
12 | 446ba751 |
13 | 266b4bab |
14 | 16bd1873 |
15 | dbb69da |
hex | 95bcaad |
157010605 has 4 divisors (see below), whose sum is σ = 188412732. Its totient is φ = 125608480.
The previous prime is 157010603. The next prime is 157010617. The reversal of 157010605 is 506010751.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 506010751 = 6659 ⋅75989.
It can be written as a sum of positive squares in 2 ways, for example, as 18783556 + 138227049 = 4334^2 + 11757^2 .
It is not a de Polignac number, because 157010605 - 21 = 157010603 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 157010605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (157010603) 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, 15701056 + ... + 15701065.
It is an arithmetic number, because the mean of its divisors is an integer number (47103183).
Almost surely, 2157010605 is an apocalyptic number.
It is an amenable number.
157010605 is a deficient number, since it is larger than the sum of its proper divisors (31402127).
157010605 is an equidigital number, since it uses as much as digits as its factorization.
157010605 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31402126.
The product of its (nonzero) digits is 1050, while the sum is 25.
The square root of 157010605 is about 12530.3872645661. The cubic root of 157010605 is about 539.4812175819.
The spelling of 157010605 in words is "one hundred fifty-seven million, ten thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •