Base | Representation |
---|---|
bin | 10010111010001… |
… | …01100111010101 |
3 | 102001110201220011 |
4 | 21131011213111 |
5 | 311101320432 |
6 | 23423440221 |
7 | 3634151215 |
oct | 1135054725 |
9 | 361421804 |
10 | 158620117 |
11 | 8159a707 |
12 | 45156071 |
13 | 26b29676 |
14 | 170d0245 |
15 | ddd3847 |
hex | 97459d5 |
158620117 has 4 divisors (see below), whose sum is σ = 160102656. Its totient is φ = 157137580.
The previous prime is 158620097. The next prime is 158620139. The reversal of 158620117 is 711026851.
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.
It is a cyclic number.
It is not a de Polignac number, because 158620117 - 211 = 158618069 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 not an unprimeable number, because it can be changed into a prime (158620157) 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, 741109 + ... + 741322.
It is an arithmetic number, because the mean of its divisors is an integer number (40025664).
Almost surely, 2158620117 is an apocalyptic number.
It is an amenable number.
158620117 is a deficient number, since it is larger than the sum of its proper divisors (1482539).
158620117 is a wasteful number, since it uses less digits than its factorization.
158620117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1482538.
The product of its (nonzero) digits is 3360, while the sum is 31.
The square root of 158620117 is about 12594.4478640391. The cubic root of 158620117 is about 541.3183573861.
Adding to 158620117 its reverse (711026851), we get a palindrome (869646968).
The spelling of 158620117 in words is "one hundred fifty-eight million, six hundred twenty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •