Base | Representation |
---|---|
bin | 101111101110110001010… |
… | …1011100101110010101111 |
3 | 212020010200121021201112102 |
4 | 1133131202223211302233 |
5 | 1324440011041431101 |
6 | 21541353240525315 |
7 | 1244643444351116 |
oct | 137354253456257 |
9 | 25203617251472 |
10 | 6560070655151 |
11 | 20aa1239561a2 |
12 | 89b47648083b |
13 | 3877c5775820 |
14 | 18971b018c7d |
15 | b599862886b |
hex | 5f762ae5caf |
6560070655151 has 8 divisors (see below), whose sum is σ = 7137523347024. Its totient is φ = 5993022516480.
The previous prime is 6560070655133. The next prime is 6560070655199. The reversal of 6560070655151 is 1515560700656.
6560070655151 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 6560070655151 - 230 = 6558996913327 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6560070655096 and 6560070655105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6560070645151) 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, 2601136985 + ... + 2601139506.
It is an arithmetic number, because the mean of its divisors is an integer number (892190418378).
Almost surely, 26560070655151 is an apocalyptic number.
6560070655151 is a deficient number, since it is larger than the sum of its proper divisors (577452691873).
6560070655151 is a wasteful number, since it uses less digits than its factorization.
6560070655151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5202276601.
The product of its (nonzero) digits is 945000, while the sum is 47.
The spelling of 6560070655151 in words is "six trillion, five hundred sixty billion, seventy million, six hundred fifty-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •