Base | Representation |
---|---|
bin | 10010110000101… |
… | …11000111110110 |
3 | 101222010210022000 |
4 | 21120113013312 |
5 | 310242143420 |
6 | 23341120130 |
7 | 3620501025 |
oct | 1130270766 |
9 | 358123260 |
10 | 157381110 |
11 | 80923837 |
12 | 44859046 |
13 | 267b4723 |
14 | 16c8a8bc |
15 | dc3b690 |
hex | 96171f6 |
157381110 has 64 divisors (see below), whose sum is σ = 433244160. Its totient is φ = 40612320.
The previous prime is 157381099. The next prime is 157381163. The reversal of 157381110 is 11183751.
157381110 is a `hidden beast` number, since 1 + 573 + 81 + 1 + 10 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1032 + ... + 17771.
It is an arithmetic number, because the mean of its divisors is an integer number (6769440).
Almost surely, 2157381110 is an apocalyptic number.
157381110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 157381110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (216622080).
157381110 is an abundant number, since it is smaller than the sum of its proper divisors (275863050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
157381110 is a wasteful number, since it uses less digits than its factorization.
157381110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18850 (or 18844 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 27.
The square root of 157381110 is about 12545.1628128136. The cubic root of 157381110 is about 539.9052302825.
The spelling of 157381110 in words is "one hundred fifty-seven million, three hundred eighty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •