Base | Representation |
---|---|
bin | 10010110001101… |
… | …11001110100000 |
3 | 101222101110200022 |
4 | 21120313032200 |
5 | 310310400413 |
6 | 23344013012 |
7 | 3621556301 |
oct | 1130671640 |
9 | 358343608 |
10 | 157512608 |
11 | 80a03610 |
12 | 44901168 |
13 | 2682c536 |
14 | 16cc27a8 |
15 | dc65608 |
hex | 96373a0 |
157512608 has 48 divisors (see below), whose sum is σ = 344717856. Its totient is φ = 70237440.
The previous prime is 157512587. The next prime is 157512617. The reversal of 157512608 is 806215751.
157512608 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 7 ways as a sum of consecutive naturals, for example, 14435 + ... + 22877.
It is an arithmetic number, because the mean of its divisors is an integer number (7181622).
Almost surely, 2157512608 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 157512608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (172358928).
157512608 is an abundant number, since it is smaller than the sum of its proper divisors (187205248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
157512608 is a wasteful number, since it uses less digits than its factorization.
157512608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8517 (or 8509 counting only the distinct ones).
The product of its (nonzero) digits is 16800, while the sum is 35.
The square root of 157512608 is about 12550.4027027024. The cubic root of 157512608 is about 540.0555589840.
The spelling of 157512608 in words is "one hundred fifty-seven million, five hundred twelve thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •