Base | Representation |
---|---|
bin | 1001001011100111111… |
… | …0101010010110000111 |
3 | 120002011002211011201010 |
4 | 2102321332222112013 |
5 | 10041022143041431 |
6 | 200244142533303 |
7 | 14252630444400 |
oct | 2227176522607 |
9 | 502132734633 |
10 | 157739033991 |
11 | 60995632a10 |
12 | 266a2597233 |
13 | 11b4aa10706 |
14 | 78c55269a7 |
15 | 418322b846 |
hex | 24b9faa587 |
157739033991 has 96 divisors (see below), whose sum is σ = 271848960000. Its totient is φ = 80426781120.
The previous prime is 157739033971. The next prime is 157739034031. The reversal of 157739033991 is 199330937751.
It is not a de Polignac number, because 157739033991 - 27 = 157739033863 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (157739033971) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 105228760 + ... + 105230258.
It is an arithmetic number, because the mean of its divisors is an integer number (2831760000).
Almost surely, 2157739033991 is an apocalyptic number.
157739033991 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
157739033991 is a deficient number, since it is larger than the sum of its proper divisors (114109926009).
157739033991 is a wasteful number, since it uses less digits than its factorization.
With its successor (157739033992) it forms a Ruth-Aaron pair, since the sum of their distinct prime factors is the same (2682).
157739033991 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2689 (or 2682 counting only the distinct ones).
The product of its (nonzero) digits is 4822335, while the sum is 57.
The spelling of 157739033991 in words is "one hundred fifty-seven billion, seven hundred thirty-nine million, thirty-three thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •