Base | Representation |
---|---|
bin | 10010101110010… |
… | …01110100111100 |
3 | 101221112201000000 |
4 | 21113021310330 |
5 | 310202031013 |
6 | 23330234300 |
7 | 3615012006 |
oct | 1127116474 |
9 | 357481000 |
10 | 157064508 |
11 | 80727987 |
12 | 44725990 |
13 | 267035a3 |
14 | 16c07376 |
15 | dbc7973 |
hex | 95c9d3c |
157064508 has 84 divisors (see below), whose sum is σ = 419336008. Its totient is φ = 51438240.
The previous prime is 157064503. The next prime is 157064533. The reversal of 157064508 is 805460751.
157064508 is a `hidden beast` number, since 1 + 5 + 7 + 0 + 645 + 0 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (157064503) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 177435 + ... + 178317.
Almost surely, 2157064508 is an apocalyptic number.
157064508 is a gapful number since it is divisible by the number (18) 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 157064508, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (209668004).
157064508 is an abundant number, since it is smaller than the sum of its proper divisors (262271500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
157064508 is an equidigital number, since it uses as much as digits as its factorization.
157064508 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 966 (or 949 counting only the distinct ones).
The product of its (nonzero) digits is 33600, while the sum is 36.
The square root of 157064508 is about 12532.5379712172. The cubic root of 157064508 is about 539.5429465947.
The spelling of 157064508 in words is "one hundred fifty-seven million, sixty-four thousand, five hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •