Base | Representation |
---|---|
bin | 111100001000000111100000… |
… | …101110001111011011111101 |
3 | 1021200022021102220022000111211 |
4 | 330020013200232033123331 |
5 | 234130043333041300121 |
6 | 2334230201231044421 |
7 | 106462126605655114 |
oct | 7410074056173375 |
9 | 1250267386260454 |
10 | 264440611665661 |
11 | 772936a7372972 |
12 | 257aa441970711 |
13 | b472847c78012 |
14 | 4942dcb36cc7b |
15 | 2088a91a51ce1 |
hex | f081e0b8f6fd |
264440611665661 has 8 divisors (see below), whose sum is σ = 275938193099520. Its totient is φ = 252943043859792.
The previous prime is 264440611665641. The next prime is 264440611665679. The reversal of 264440611665661 is 166566116044462.
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 264440611665661 - 245 = 229256239576829 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 264440611665596 and 264440611665605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (264440611665641) 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, 68858311 + ... + 72597163.
It is an arithmetic number, because the mean of its divisors is an integer number (34492274137440).
Almost surely, 2264440611665661 is an apocalyptic number.
It is an amenable number.
264440611665661 is a deficient number, since it is larger than the sum of its proper divisors (11497581433859).
264440611665661 is a wasteful number, since it uses less digits than its factorization.
264440611665661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6813995.
The product of its (nonzero) digits is 29859840, while the sum is 58.
The spelling of 264440611665661 in words is "two hundred sixty-four trillion, four hundred forty billion, six hundred eleven million, six hundred sixty-five thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •