Base | Representation |
---|---|
bin | 101111110001100111001… |
… | …0110100101101001011101 |
3 | 212020201102211011000020110 |
4 | 1133203032112211221131 |
5 | 1330040010021244112 |
6 | 21544242515040233 |
7 | 1245250602405210 |
oct | 137431626455135 |
9 | 25221384130213 |
10 | 6566172056157 |
11 | 2101774a4506a |
12 | 8a06998a0079 |
13 | 38825885598c |
14 | 189b394a1777 |
15 | b5c040e113c |
hex | 5f8ce5a5a5d |
6566172056157 has 8 divisors (see below), whose sum is σ = 10005595514176. Its totient is φ = 3752098317792.
The previous prime is 6566172056153. The next prime is 6566172056177. The reversal of 6566172056157 is 7516502716656.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6566172056157 - 22 = 6566172056153 is a prime.
It is a super-2 number, since 2×65661720561572 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6566172056097 and 6566172056106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6566172056153) 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, 156337429888 + ... + 156337429929.
It is an arithmetic number, because the mean of its divisors is an integer number (1250699439272).
Almost surely, 26566172056157 is an apocalyptic number.
It is an amenable number.
6566172056157 is a deficient number, since it is larger than the sum of its proper divisors (3439423458019).
6566172056157 is a wasteful number, since it uses less digits than its factorization.
6566172056157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312674859827.
The product of its (nonzero) digits is 15876000, while the sum is 57.
The spelling of 6566172056157 in words is "six trillion, five hundred sixty-six billion, one hundred seventy-two million, fifty-six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •