Base | Representation |
---|---|
bin | 10010111011000… |
… | …00010011101010 |
3 | 102001200021212112 |
4 | 21131200103222 |
5 | 311113320300 |
6 | 23430042322 |
7 | 3635115035 |
oct | 1135402352 |
9 | 361607775 |
10 | 158729450 |
11 | 81664870 |
12 | 451a93a2 |
13 | 26b67369 |
14 | 1711c01c |
15 | de05e35 |
hex | 97604ea |
158729450 has 48 divisors (see below), whose sum is σ = 329978880. Its totient is φ = 56304000.
The previous prime is 158729447. The next prime is 158729507. The reversal of 158729450 is 54927851.
158729450 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a junction number, because it is equal to n+sod(n) for n = 158729398 and 158729407.
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 23 ways as a sum of consecutive naturals, for example, 19031 + ... + 26069.
It is an arithmetic number, because the mean of its divisors is an integer number (6874560).
Almost surely, 2158729450 is an apocalyptic number.
158729450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
158729450 is an abundant number, since it is smaller than the sum of its proper divisors (171249430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
158729450 is a wasteful number, since it uses less digits than its factorization.
158729450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7103 (or 7098 counting only the distinct ones).
The product of its (nonzero) digits is 100800, while the sum is 41.
The square root of 158729450 is about 12598.7876400866. The cubic root of 158729450 is about 541.4427013602.
The spelling of 158729450 in words is "one hundred fifty-eight million, seven hundred twenty-nine thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •