Base | Representation |
---|---|
bin | 100000100110011001100… |
… | …011011001110111100101 |
3 | 21221011111011102112210211 |
4 | 200212121203121313211 |
5 | 243201020031000021 |
6 | 4433054125215421 |
7 | 320565405065152 |
oct | 40463143316745 |
9 | 7834434375724 |
10 | 2240254156261 |
11 | 7940a5082420 |
12 | 302214701571 |
13 | 1333414a2204 |
14 | 7a600bbb229 |
15 | 3d41a3de3e1 |
hex | 209998d9de5 |
2240254156261 has 8 divisors (see below), whose sum is σ = 2444011027200. Its totient is φ = 2036513519040.
The previous prime is 2240254156247. The next prime is 2240254156271. The reversal of 2240254156261 is 1626514520422.
2240254156261 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 not a de Polignac number, because 2240254156261 - 25 = 2240254156229 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2240254156201) 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, 3768981 + ... + 4322698.
It is an arithmetic number, because the mean of its divisors is an integer number (305501378400).
Almost surely, 22240254156261 is an apocalyptic number.
It is an amenable number.
2240254156261 is a deficient number, since it is larger than the sum of its proper divisors (203756870939).
2240254156261 is a wasteful number, since it uses less digits than its factorization.
2240254156261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8116859.
The product of its (nonzero) digits is 230400, while the sum is 40.
Adding to 2240254156261 its reverse (1626514520422), we get a palindrome (3866768676683).
The spelling of 2240254156261 in words is "two trillion, two hundred forty billion, two hundred fifty-four million, one hundred fifty-six thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •