Base | Representation |
---|---|
bin | 10010110000011… |
… | …11010010000000 |
3 | 101222002011020110 |
4 | 21120033102000 |
5 | 310240131432 |
6 | 23340311320 |
7 | 3620305263 |
oct | 1130172200 |
9 | 358064213 |
10 | 157348992 |
11 | 80901699 |
12 | 44842540 |
13 | 267a2c18 |
14 | 16c7ccda |
15 | dc31dcc |
hex | 960f480 |
157348992 has 64 divisors (see below), whose sum is σ = 419268960. Its totient is φ = 52285440.
The previous prime is 157348979. The next prime is 157348999. The reversal of 157348992 is 299843751.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (157348999) 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, 227367 + ... + 228057.
Almost surely, 2157348992 is an apocalyptic number.
157348992 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 157348992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (209634480).
157348992 is an abundant number, since it is smaller than the sum of its proper divisors (261919968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
157348992 is an equidigital number, since it uses as much as digits as its factorization.
157348992 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1301 (or 1289 counting only the distinct ones).
The product of its digits is 544320, while the sum is 48.
The square root of 157348992 is about 12543.8826525123. The cubic root of 157348992 is about 539.8685002160.
The spelling of 157348992 in words is "one hundred fifty-seven million, three hundred forty-eight thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •