Base | Representation |
---|---|
bin | 10010110000110… |
… | …00100010100000 |
3 | 101222011002020220 |
4 | 21120120202200 |
5 | 310242340122 |
6 | 23341203040 |
7 | 3620523654 |
oct | 1130304240 |
9 | 358132226 |
10 | 157386912 |
11 | 80928131 |
12 | 44860480 |
13 | 267b7267 |
14 | 16c8ca64 |
15 | dc3d25c |
hex | 96188a0 |
157386912 has 48 divisors (see below), whose sum is σ = 415951200. Its totient is φ = 52105472.
The previous prime is 157386883. The next prime is 157386917. The reversal of 157386912 is 219683751.
It is a tau number, because it is divible by the number of its divisors (48).
It is not an unprimeable number, because it can be changed into a prime (157386917) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8803 + ... + 19805.
It is an arithmetic number, because the mean of its divisors is an integer number (8665650).
Almost surely, 2157386912 is an apocalyptic number.
157386912 is a gapful number since it is divisible by the number (12) 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 157386912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (207975600).
157386912 is an abundant number, since it is smaller than the sum of its proper divisors (258564288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
157386912 is a wasteful number, since it uses less digits than its factorization.
157386912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11165 (or 11157 counting only the distinct ones).
The product of its digits is 90720, while the sum is 42.
The square root of 157386912 is about 12545.3940551901. The cubic root of 157386912 is about 539.9118649027.
The spelling of 157386912 in words is "one hundred fifty-seven million, three hundred eighty-six thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •