Base | Representation |
---|---|
bin | 100000100110010001110… |
… | …111101000110011110011 |
3 | 21221011011011212001112012 |
4 | 200212101313220303303 |
5 | 243200234030230421 |
6 | 4433033242153135 |
7 | 320562251250464 |
oct | 40462167506363 |
9 | 7834134761465 |
10 | 2240125242611 |
11 | 794039332713 |
12 | 3021994b27ab |
13 | 133320877049 |
14 | 7a5cba20d6b |
15 | 3d40de2795b |
hex | 20991de8cf3 |
2240125242611 has 4 divisors (see below), whose sum is σ = 2240230340400. Its totient is φ = 2240020144824.
The previous prime is 2240125242601. The next prime is 2240125242623. The reversal of 2240125242611 is 1162425210422.
2240125242611 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2240125242611 is a prime.
It is a super-2 number, since 2×22401252426112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2240125242601) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52516916 + ... + 52559553.
It is an arithmetic number, because the mean of its divisors is an integer number (560057585100).
Almost surely, 22240125242611 is an apocalyptic number.
2240125242611 is a deficient number, since it is larger than the sum of its proper divisors (105097789).
2240125242611 is a wasteful number, since it uses less digits than its factorization.
2240125242611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105097788.
The product of its (nonzero) digits is 15360, while the sum is 32.
The spelling of 2240125242611 in words is "two trillion, two hundred forty billion, one hundred twenty-five million, two hundred forty-two thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •