Base | Representation |
---|---|
bin | 1001001101100011011… |
… | …1011101111111110001 |
3 | 120010111012220212120221 |
4 | 2103120313131333301 |
5 | 10043102323221342 |
6 | 200411413533041 |
7 | 14301522235243 |
oct | 2233067357761 |
9 | 503435825527 |
10 | 158257242097 |
11 | 611310a6379 |
12 | 26808044181 |
13 | 11c0119c426 |
14 | 793429c093 |
15 | 41b398ea67 |
hex | 24d8dddff1 |
158257242097 has 4 divisors (see below), whose sum is σ = 161937643120. Its totient is φ = 154576841076.
The previous prime is 158257242049. The next prime is 158257242103. The reversal of 158257242097 is 790242752851.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 790242752851 = 67 ⋅11794667953.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-158257242097 is a prime.
It is a super-2 number, since 2×1582572420972 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (158257282097) 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, 1840200447 + ... + 1840200532.
It is an arithmetic number, because the mean of its divisors is an integer number (40484410780).
Almost surely, 2158257242097 is an apocalyptic number.
It is an amenable number.
158257242097 is a deficient number, since it is larger than the sum of its proper divisors (3680401023).
158257242097 is an equidigital number, since it uses as much as digits as its factorization.
158257242097 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3680401022.
The product of its (nonzero) digits is 2822400, while the sum is 52.
The spelling of 158257242097 in words is "one hundred fifty-eight billion, two hundred fifty-seven million, two hundred forty-two thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •