Base | Representation |
---|---|
bin | 10010110110001… |
… | …00110010011001 |
3 | 102000110221001121 |
4 | 21123010302121 |
5 | 310432424231 |
6 | 23404245241 |
7 | 3626522623 |
oct | 1133046231 |
9 | 360427047 |
10 | 158092441 |
11 | 8126a211 |
12 | 44b40821 |
13 | 269a3430 |
14 | 16dd3c13 |
15 | dd2c311 |
hex | 96c4c99 |
158092441 has 4 divisors (see below), whose sum is σ = 170253412. Its totient is φ = 145931472.
The previous prime is 158092421. The next prime is 158092531. The reversal of 158092441 is 144290851.
It is a happy number.
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 64080025 + 94012416 = 8005^2 + 9696^2 .
It is a cyclic number.
It is not a de Polignac number, because 158092441 - 27 = 158092313 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 158092397 and 158092406.
It is not an unprimeable number, because it can be changed into a prime (158092421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6080466 + ... + 6080491.
It is an arithmetic number, because the mean of its divisors is an integer number (42563353).
Almost surely, 2158092441 is an apocalyptic number.
It is an amenable number.
158092441 is a deficient number, since it is larger than the sum of its proper divisors (12160971).
158092441 is a wasteful number, since it uses less digits than its factorization.
158092441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12160970.
The product of its (nonzero) digits is 11520, while the sum is 34.
The square root of 158092441 is about 12573.4816578385. The cubic root of 158092441 is about 540.7174289093.
The spelling of 158092441 in words is "one hundred fifty-eight million, ninety-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •