Base | Representation |
---|---|
bin | 100110011011010000101… |
… | …011110001001100000101 |
3 | 100100102212201120012221001 |
4 | 212123100223301030011 |
5 | 321230432412214331 |
6 | 5341025135053301 |
7 | 361530542423311 |
oct | 46332053611405 |
9 | 10312781505831 |
10 | 2640611054341 |
11 | 928971110607 |
12 | 367927371231 |
13 | 162015a40440 |
14 | 91b40524b41 |
15 | 48a4d2d5561 |
hex | 266d0af1305 |
2640611054341 has 8 divisors (see below), whose sum is σ = 2846856547584. Its totient is φ = 2434811499120.
The previous prime is 2640611054311. The next prime is 2640611054353. The reversal of 2640611054341 is 1434501160462.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2640611054341 - 213 = 2640611046149 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2640611054341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2640611054311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 111472201 + ... + 111495886.
It is an arithmetic number, because the mean of its divisors is an integer number (355857068448).
Almost surely, 22640611054341 is an apocalyptic number.
It is an amenable number.
2640611054341 is a deficient number, since it is larger than the sum of its proper divisors (206245493243).
2640611054341 is a wasteful number, since it uses less digits than its factorization.
2640611054341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222969011.
The product of its (nonzero) digits is 69120, while the sum is 37.
The spelling of 2640611054341 in words is "two trillion, six hundred forty billion, six hundred eleven million, fifty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •