Base | Representation |
---|---|
bin | 10010111100101… |
… | …01101010100000 |
3 | 102002002101122222 |
4 | 21132111222200 |
5 | 311142314000 |
6 | 23434450212 |
7 | 3640015151 |
oct | 1136255240 |
9 | 362071588 |
10 | 158948000 |
11 | 817a3a92 |
12 | 45293968 |
13 | 26c12993 |
14 | 17177928 |
15 | de4aa85 |
hex | 9795aa0 |
158948000 has 96 divisors (see below), whose sum is σ = 396264960. Its totient is φ = 62649600.
The previous prime is 158947981. The next prime is 158948087. The reversal of 158948000 is 849851.
Together with 237316959 it forms a betrothed pair.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 315749 + ... + 316251.
It is an arithmetic number, because the mean of its divisors is an integer number (4127760).
Almost surely, 2158948000 is an apocalyptic number.
158948000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 158948000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (198132480).
158948000 is an abundant number, since it is smaller than the sum of its proper divisors (237316960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
158948000 is an equidigital number, since it uses as much as digits as its factorization.
158948000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 607 (or 589 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 35.
The square root of 158948000 is about 12607.4581101822. The cubic root of 158948000 is about 541.6910863416.
The spelling of 158948000 in words is "one hundred fifty-eight million, nine hundred forty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •