Base | Representation |
---|---|
bin | 10010101111011… |
… | …10011110001101 |
3 | 101221211022220011 |
4 | 21113232132031 |
5 | 310221331410 |
6 | 23333353221 |
7 | 3616205422 |
oct | 1127563615 |
9 | 357738804 |
10 | 157214605 |
11 | 8081a729 |
12 | 44798811 |
13 | 267569c2 |
14 | 16c45d49 |
15 | dc0718a |
hex | 95ee78d |
157214605 has 4 divisors (see below), whose sum is σ = 188657532. Its totient is φ = 125771680.
The previous prime is 157214587. The next prime is 157214611. The reversal of 157214605 is 506412751.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 122014116 + 35200489 = 11046^2 + 5933^2 .
It is not a de Polignac number, because 157214605 - 211 = 157212557 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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, 15721456 + ... + 15721465.
It is an arithmetic number, because the mean of its divisors is an integer number (47164383).
Almost surely, 2157214605 is an apocalyptic number.
It is an amenable number.
157214605 is a deficient number, since it is larger than the sum of its proper divisors (31442927).
157214605 is an equidigital number, since it uses as much as digits as its factorization.
157214605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31442926.
The product of its (nonzero) digits is 8400, while the sum is 31.
The square root of 157214605 is about 12538.5248334882. The cubic root of 157214605 is about 539.7147613377.
The spelling of 157214605 in words is "one hundred fifty-seven million, two hundred fourteen thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •