Base | Representation |
---|---|
bin | 100110011011001010111… |
… | …110101110011010111000 |
3 | 100100102122001111110120111 |
4 | 212123022332232122320 |
5 | 321230233413013230 |
6 | 5341011440034104 |
7 | 361525301144326 |
oct | 46331276563270 |
9 | 10312561443514 |
10 | 2640515360440 |
11 | 9289220a0341 |
12 | 3678bb302934 |
13 | 161ccbc76929 |
14 | 91b31934d16 |
15 | 48a44bd192a |
hex | 266cafae6b8 |
2640515360440 has 64 divisors (see below), whose sum is σ = 6002512205760. Its totient is φ = 1045307827200.
The previous prime is 2640515360411. The next prime is 2640515360447. The reversal of 2640515360440 is 440635150462.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 2640515360393 and 2640515360402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2640515360447) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9531157 + ... + 9804283.
It is an arithmetic number, because the mean of its divisors is an integer number (93789253215).
Almost surely, 22640515360440 is an apocalyptic number.
2640515360440 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2640515360440 is an abundant number, since it is smaller than the sum of its proper divisors (3361996845320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2640515360440 is a wasteful number, since it uses less digits than its factorization.
2640515360440 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 275632 (or 275628 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 40.
The spelling of 2640515360440 in words is "two trillion, six hundred forty billion, five hundred fifteen million, three hundred sixty thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •