Base | Representation |
---|---|
bin | 10010110001011… |
… | …11010001000000 |
3 | 101222022210221121 |
4 | 21120233101000 |
5 | 310303330000 |
6 | 23343202024 |
7 | 3621362236 |
oct | 1130572100 |
9 | 358283847 |
10 | 157480000 |
11 | 80991067 |
12 | 448a6314 |
13 | 2681a742 |
14 | 16cb4956 |
15 | dc5ab1a |
hex | 962f440 |
157480000 has 140 divisors (see below), whose sum is σ = 406269952. Its totient is φ = 60480000.
The previous prime is 157479989. The next prime is 157480009. The reversal of 157480000 is 84751.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (157480009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1239937 + ... + 1240063.
Almost surely, 2157480000 is an apocalyptic number.
157480000 is a gapful number since it is divisible by the number (10) 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 157480000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (203134976).
157480000 is an abundant number, since it is smaller than the sum of its proper divisors (248789952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
157480000 is an equidigital number, since it uses as much as digits as its factorization.
157480000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190 (or 165 counting only the distinct ones).
The product of its (nonzero) digits is 1120, while the sum is 25.
The square root of 157480000 is about 12549.1035536408. The cubic root of 157480000 is about 540.0182892754.
The spelling of 157480000 in words is "one hundred fifty-seven million, four hundred eighty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •