Base | Representation |
---|---|
bin | 100011101101011111010111… |
… | …000011100011111100000101 |
3 | 202121002120022120011110112010 |
4 | 203231133113003203330011 |
5 | 131041213110322213114 |
6 | 1314011144551044433 |
7 | 45040020436532016 |
oct | 4355372703437405 |
9 | 677076276143463 |
10 | 157057677147909 |
11 | 460528722a049a |
12 | 157469b6370719 |
13 | 6983624607c15 |
14 | 2aad8bc80900d |
15 | 132566d498c59 |
hex | 8ed7d70e3f05 |
157057677147909 has 8 divisors (see below), whose sum is σ = 209410496421280. Its totient is φ = 104704987986576.
The previous prime is 157057677147883. The next prime is 157057677147941. The reversal of 157057677147909 is 909741776750751.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 157057677147909 - 228 = 157057408712453 is a prime.
It is a super-2 number, since 2×1570576771479092 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (157057677147809) 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, 29675722 + ... + 34565355.
It is an arithmetic number, because the mean of its divisors is an integer number (26176312052660).
Almost surely, 2157057677147909 is an apocalyptic number.
It is an amenable number.
157057677147909 is a deficient number, since it is larger than the sum of its proper divisors (52352819273371).
157057677147909 is an equidigital number, since it uses as much as digits as its factorization.
157057677147909 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65056019.
The product of its (nonzero) digits is 816820200, while the sum is 75.
The spelling of 157057677147909 in words is "one hundred fifty-seven trillion, fifty-seven billion, six hundred seventy-seven million, one hundred forty-seven thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •