Base | Representation |
---|---|
bin | 10010111101000… |
… | …00111000111110 |
3 | 102002011201202000 |
4 | 21132200320332 |
5 | 311200301412 |
6 | 23435443130 |
7 | 3640266210 |
oct | 1136407076 |
9 | 362151660 |
10 | 158993982 |
11 | 81825594 |
12 | 452b64a6 |
13 | 26c2a8a4 |
14 | 1718a5b0 |
15 | de594dc |
hex | 97a0e3e |
158993982 has 64 divisors (see below), whose sum is σ = 413683200. Its totient is φ = 44314560.
The previous prime is 158993981. The next prime is 158994001. The reversal of 158993982 is 289399851.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (158993981) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10369 + ... + 20627.
It is an arithmetic number, because the mean of its divisors is an integer number (6463800).
Almost surely, 2158993982 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 158993982, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (206841600).
158993982 is an abundant number, since it is smaller than the sum of its proper divisors (254689218).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
158993982 is a wasteful number, since it uses less digits than its factorization.
158993982 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10318 (or 10312 counting only the distinct ones).
The product of its digits is 1399680, while the sum is 54.
The square root of 158993982 is about 12609.2815814383. The cubic root of 158993982 is about 541.7433165008.
It can be divided in two parts, 15899 and 3982, that added together give a square (19881 = 1412).
The spelling of 158993982 in words is "one hundred fifty-eight million, nine hundred ninety-three thousand, nine hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •