Base | Representation |
---|---|
bin | 1001001001001101101… |
… | …1101001011110100111 |
3 | 120000111000220202112012 |
4 | 2102103123221132213 |
5 | 10033211113234231 |
6 | 200100041344435 |
7 | 14230615461341 |
oct | 2222333513647 |
9 | 500430822465 |
10 | 157092321191 |
11 | 6069357a023 |
12 | 26541a9811b |
13 | 11a76a3aa10 |
14 | 78636a0291 |
15 | 4146582e2b |
hex | 24936e97a7 |
157092321191 has 4 divisors (see below), whose sum is σ = 169176345912. Its totient is φ = 145008296472.
The previous prime is 157092321179. The next prime is 157092321193. The reversal of 157092321191 is 191123290751.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 191123290751 = 203591 ⋅938761.
It is a de Polignac number, because none of the positive numbers 2k-157092321191 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 (157092321193) 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, 6042012341 + ... + 6042012366.
It is an arithmetic number, because the mean of its divisors is an integer number (42294086478).
Almost surely, 2157092321191 is an apocalyptic number.
157092321191 is a deficient number, since it is larger than the sum of its proper divisors (12084024721).
157092321191 is a wasteful number, since it uses less digits than its factorization.
157092321191 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12084024720.
The product of its (nonzero) digits is 34020, while the sum is 41.
The spelling of 157092321191 in words is "one hundred fifty-seven billion, ninety-two million, three hundred twenty-one thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •