Base | Representation |
---|---|
bin | 10010111000100… |
… | …01111011110000 |
3 | 102001001222111222 |
4 | 21130101323300 |
5 | 311023032212 |
6 | 23415124212 |
7 | 3632310110 |
oct | 1134217360 |
9 | 361058458 |
10 | 158408432 |
11 | 81465666 |
12 | 45073668 |
13 | 26a84200 |
14 | 17077040 |
15 | dd90c72 |
hex | 9711ef0 |
158408432 has 60 divisors (see below), whose sum is σ = 379864080. Its totient is φ = 62659584.
The previous prime is 158408423. The next prime is 158408449. The reversal of 158408432 is 234804851.
158408432 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 158408392 and 158408401.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14744 + ... + 23112.
It is an arithmetic number, because the mean of its divisors is an integer number (6331068).
Almost surely, 2158408432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 158408432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (189932040).
158408432 is an abundant number, since it is smaller than the sum of its proper divisors (221455648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
158408432 is a wasteful number, since it uses less digits than its factorization.
158408432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8410 (or 8391 counting only the distinct ones).
The product of its (nonzero) digits is 30720, while the sum is 35.
The square root of 158408432 is about 12586.0411567736. The cubic root of 158408432 is about 541.0774463948.
The spelling of 158408432 in words is "one hundred fifty-eight million, four hundred eight thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •