Base | Representation |
---|---|
bin | 111010010110110100101010… |
… | …100101000011101011001001 |
3 | 1020122201222121110122002110012 |
4 | 322112310222211003223021 |
5 | 232120014043204031041 |
6 | 2305505414102001305 |
7 | 105026501006524310 |
oct | 7226645245035311 |
9 | 1218658543562405 |
10 | 256655075064521 |
11 | 74861895987531 |
12 | 24951581416235 |
13 | b029614cc0503 |
14 | 4754259a33277 |
15 | 1ea12c2bcc3eb |
hex | e96d2a943ac9 |
256655075064521 has 8 divisors (see below), whose sum is σ = 295262602913664. Its totient is φ = 218533176496800.
The previous prime is 256655075064511. The next prime is 256655075064523. The reversal of 256655075064521 is 125460570556652.
256655075064521 is digitally balanced in base 2, 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 256655075064521 - 26 = 256655075064457 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (256655075064523) 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, 121407319220 + ... + 121407321333.
It is an arithmetic number, because the mean of its divisors is an integer number (36907825364208).
Almost surely, 2256655075064521 is an apocalyptic number.
It is an amenable number.
256655075064521 is a deficient number, since it is larger than the sum of its proper divisors (38607527849143).
256655075064521 is a wasteful number, since it uses less digits than its factorization.
256655075064521 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 242814640711.
The product of its (nonzero) digits is 75600000, while the sum is 59.
The spelling of 256655075064521 in words is "two hundred fifty-six trillion, six hundred fifty-five billion, seventy-five million, sixty-four thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •