Base | Representation |
---|---|
bin | 10010110001101… |
… | …11100101010110 |
3 | 101222101112200110 |
4 | 21120313211112 |
5 | 310310422240 |
6 | 23344023450 |
7 | 3621563460 |
oct | 1130674526 |
9 | 358345613 |
10 | 157514070 |
11 | 80a0471a |
12 | 44901b86 |
13 | 268300bc |
14 | 16cc3130 |
15 | dc65c80 |
hex | 9637956 |
157514070 has 64 divisors (see below), whose sum is σ = 439395840. Its totient is φ = 35390208.
The previous prime is 157514053. The next prime is 157514081. The reversal of 157514070 is 70415751.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
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, 6034 + ... + 18746.
It is an arithmetic number, because the mean of its divisors is an integer number (6865560).
Almost surely, 2157514070 is an apocalyptic number.
157514070 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 157514070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (219697920).
157514070 is an abundant number, since it is smaller than the sum of its proper divisors (281881770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
157514070 is a wasteful number, since it uses less digits than its factorization.
157514070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12789.
The product of its (nonzero) digits is 4900, while the sum is 30.
The square root of 157514070 is about 12550.4609477102. The cubic root of 157514070 is about 540.0572298741.
The spelling of 157514070 in words is "one hundred fifty-seven million, five hundred fourteen thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •