Base | Representation |
---|---|
bin | 1001001000111010010… |
… | …1110110000100110001 |
3 | 120000021101002201011121 |
4 | 2102032211312010301 |
5 | 10033024320430040 |
6 | 200044020542241 |
7 | 14225611253533 |
oct | 2221645660461 |
9 | 500241081147 |
10 | 157011108145 |
11 | 6065174a501 |
12 | 2651a851981 |
13 | 11a62c74468 |
14 | 785699d853 |
15 | 413e38ec4a |
hex | 248e976131 |
157011108145 has 8 divisors (see below), whose sum is σ = 188420112000. Its totient is φ = 125604365040.
The previous prime is 157011108139. The next prime is 157011108151. The reversal of 157011108145 is 541801110751.
It is an interprime number because it is at equal distance from previous prime (157011108139) and next prime (157011108151).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-157011108145 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 157011108145.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 408441 + ... + 693430.
It is an arithmetic number, because the mean of its divisors is an integer number (23552514000).
Almost surely, 2157011108145 is an apocalyptic number.
It is an amenable number.
157011108145 is a deficient number, since it is larger than the sum of its proper divisors (31409003855).
157011108145 is a wasteful number, since it uses less digits than its factorization.
157011108145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1130375.
The product of its (nonzero) digits is 5600, while the sum is 34.
Adding to 157011108145 its reverse (541801110751), we get a palindrome (698812218896).
The spelling of 157011108145 in words is "one hundred fifty-seven billion, eleven million, one hundred eight thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •