Base | Representation |
---|---|
bin | 100110011010101110001… |
… | …010010110110100100011 |
3 | 100100101101100201121201011 |
4 | 212122232022112310203 |
5 | 321223241124321433 |
6 | 5340451445121351 |
7 | 361510310432035 |
oct | 46325612266443 |
9 | 10311340647634 |
10 | 2640031870243 |
11 | 9286a418aa69 |
12 | 3677a53b9257 |
13 | 161c52a52461 |
14 | 91ac7639c55 |
15 | 48a1752a3cd |
hex | 266ae296d23 |
2640031870243 has 8 divisors (see below), whose sum is σ = 2690575999488. Its totient is φ = 2589966832584.
The previous prime is 2640031870163. The next prime is 2640031870247. The reversal of 2640031870243 is 3420781300462.
It is a happy number.
2640031870243 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 2640031870243 - 225 = 2639998315811 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2640031870196 and 2640031870205.
It is not an unprimeable number, because it can be changed into a prime (2640031870247) 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, 119761771 + ... + 119783812.
It is an arithmetic number, because the mean of its divisors is an integer number (336321999936).
Almost surely, 22640031870243 is an apocalyptic number.
2640031870243 is a deficient number, since it is larger than the sum of its proper divisors (50544129245).
2640031870243 is a wasteful number, since it uses less digits than its factorization.
2640031870243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239545793.
The product of its (nonzero) digits is 193536, while the sum is 40.
The spelling of 2640031870243 in words is "two trillion, six hundred forty billion, thirty-one million, eight hundred seventy thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.197 sec. • engine limits •