Search a number
-
+
158691055 = 531738211
BaseRepresentation
bin10010111010101…
…10111011101111
3102001121100012111
421131112323233
5311111103210
623425144451
73634565065
oct1135267357
9361540174
10158691055
1181638a36
124518b127
1326b52a43
141710c035
15dde988a
hex9756eef

158691055 has 4 divisors (see below), whose sum is σ = 190429272. Its totient is φ = 126952840.

The previous prime is 158691031. The next prime is 158691083. The reversal of 158691055 is 550196851.

It is a semiprime because it is the product of two primes.

It is not a de Polignac number, because 158691055 - 27 = 158690927 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 158690999 and 158691017.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15869101 + ... + 15869110.

It is an arithmetic number, because the mean of its divisors is an integer number (47607318).

Almost surely, 2158691055 is an apocalyptic number.

158691055 is a deficient number, since it is larger than the sum of its proper divisors (31738217).

158691055 is an equidigital number, since it uses as much as digits as its factorization.

158691055 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 31738216.

The product of its (nonzero) digits is 54000, while the sum is 40.

The square root of 158691055 is about 12597.2637902046. The cubic root of 158691055 is about 541.3990413905.

The spelling of 158691055 in words is "one hundred fifty-eight million, six hundred ninety-one thousand, fifty-five".

Divisors: 1 5 31738211 158691055