Base | Representation |
---|---|
bin | 1001001001010011101… |
… | …0000100000010111111 |
3 | 120000112202111012122012 |
4 | 2102110322010002333 |
5 | 10033233432242201 |
6 | 200102324041435 |
7 | 14231336033666 |
oct | 2222472040277 |
9 | 500482435565 |
10 | 157117071551 |
11 | 606a6544370 |
12 | 2654a23327b |
13 | 11a7bbc53bb |
14 | 7866aa3ddd |
15 | 41488215bb |
hex | 2494e840bf |
157117071551 has 8 divisors (see below), whose sum is σ = 171408133584. Its totient is φ = 142827291520.
The previous prime is 157117071547. The next prime is 157117071569. The reversal of 157117071551 is 155170711751.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 157117071551 - 22 = 157117071547 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 157117071499 and 157117071508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (157117071511) by changing a digit.
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, 54650 + ... + 563223.
It is an arithmetic number, because the mean of its divisors is an integer number (21426016698).
Almost surely, 2157117071551 is an apocalyptic number.
157117071551 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
157117071551 is a deficient number, since it is larger than the sum of its proper divisors (14291062033).
157117071551 is a wasteful number, since it uses less digits than its factorization.
157117071551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 641001.
The product of its (nonzero) digits is 42875, while the sum is 41.
The spelling of 157117071551 in words is "one hundred fifty-seven billion, one hundred seventeen million, seventy-one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •