Base | Representation |
---|---|
bin | 100110011010110100100… |
… | …111011010111111010001 |
3 | 100100101122220110221102200 |
4 | 212122310213122333101 |
5 | 321224001334342120 |
6 | 5340510314033413 |
7 | 361513064011422 |
oct | 46326447327721 |
9 | 10311586427380 |
10 | 2640140152785 |
11 | 92874a319273 |
12 | 367815718869 |
13 | 161c6c305b75 |
14 | 91ad7b85649 |
15 | 48a21cb8e90 |
hex | 266b49dafd1 |
2640140152785 has 48 divisors (see below), whose sum is σ = 4791508210944. Its totient is φ = 1342257181056.
The previous prime is 2640140152757. The next prime is 2640140152787. The reversal of 2640140152785 is 5872510410462.
2640140152785 is a `hidden beast` number, since 2 + 6 + 4 + 0 + 1 + 40 + 1 + 527 + 85 = 666.
It is not a de Polignac number, because 2640140152785 - 26 = 2640140152721 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2640140152785.
It is not an unprimeable number, because it can be changed into a prime (2640140152787) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4049749 + ... + 4656258.
It is an arithmetic number, because the mean of its divisors is an integer number (99823087728).
Almost surely, 22640140152785 is an apocalyptic number.
It is an amenable number.
2640140152785 is a deficient number, since it is larger than the sum of its proper divisors (2151368058159).
2640140152785 is a wasteful number, since it uses less digits than its factorization.
2640140152785 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8706334 (or 8706331 counting only the distinct ones).
The product of its (nonzero) digits is 537600, while the sum is 45.
The spelling of 2640140152785 in words is "two trillion, six hundred forty billion, one hundred forty million, one hundred fifty-two thousand, seven hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 4.188 sec. • engine limits •