Search a number
-
+
158069990 = 25131215923
BaseRepresentation
bin10010110101111…
…11010011100110
3102000102210021002
421122333103212
5310431214430
623403553302
73626400311
oct1132772346
9360383232
10158069990
1181254361
1244b2b832
1326996150
1416dc9978
15dd25845
hex96bf4e6

158069990 has 16 divisors (see below), whose sum is σ = 306412848. Its totient is φ = 58364256.

The previous prime is 158069983. The next prime is 158069999. The reversal of 158069990 is 99960851.

It is a super-2 number, since 2×1580699902 = 49972243477200200, which contains 22 as substring.

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (158069999) 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 7 ways as a sum of consecutive naturals, for example, 607832 + ... + 608091.

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

Almost surely, 2158069990 is an apocalyptic number.

158069990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

158069990 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1215943.

The product of its (nonzero) digits is 174960, while the sum is 47.

The square root of 158069990 is about 12572.5888344446. The cubic root of 158069990 is about 540.6918316035.

The spelling of 158069990 in words is "one hundred fifty-eight million, sixty-nine thousand, nine hundred ninety".

Divisors: 1 2 5 10 13 26 65 130 1215923 2431846 6079615 12159230 15806999 31613998 79034995 158069990