Base | Representation |
---|---|
bin | 10010110101110… |
… | …11001011110101 |
3 | 102000101221002212 |
4 | 21122323023311 |
5 | 310430144414 |
6 | 23403343205 |
7 | 3626300144 |
oct | 1132731365 |
9 | 360357085 |
10 | 158053109 |
11 | 81242705 |
12 | 44b21b05 |
13 | 2698b566 |
14 | 16dc375b |
15 | dd2083e |
hex | 96bb2f5 |
158053109 has 4 divisors (see below), whose sum is σ = 158100204. Its totient is φ = 158006016.
The previous prime is 158053081. The next prime is 158053111. The reversal of 158053109 is 901350851.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 901350851 = 27631 ⋅32621.
It can be written as a sum of positive squares in 2 ways, for example, as 39025009 + 119028100 = 6247^2 + 10910^2 .
It is a cyclic number.
It is not a de Polignac number, because 158053109 - 216 = 157987573 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 (158053139) 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, 18092 + ... + 25365.
It is an arithmetic number, because the mean of its divisors is an integer number (39525051).
Almost surely, 2158053109 is an apocalyptic number.
It is an amenable number.
158053109 is a deficient number, since it is larger than the sum of its proper divisors (47095).
158053109 is an equidigital number, since it uses as much as digits as its factorization.
158053109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47094.
The product of its (nonzero) digits is 5400, while the sum is 32.
The square root of 158053109 is about 12571.9174750712. The cubic root of 158053109 is about 540.6725832866.
The spelling of 158053109 in words is "one hundred fifty-eight million, fifty-three thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •