Base | Representation |
---|---|
bin | 100000010011110100111… |
… | …110011001001000011111 |
3 | 21212021000102212000101211 |
4 | 200103310332121020133 |
5 | 242334200124340221 |
6 | 4415555303445251 |
7 | 316261300065055 |
oct | 40236476311037 |
9 | 7767012760354 |
10 | 2220313121311 |
11 | 7866a196774a |
12 | 2ba38a456827 |
13 | 1314b40a144c |
14 | 7966c6841d5 |
15 | 3cb4e91e6e1 |
hex | 204f4f9921f |
2220313121311 has 8 divisors (see below), whose sum is σ = 2222748356400. Its totient is φ = 2217879121920.
The previous prime is 2220313121293. The next prime is 2220313121317. The reversal of 2220313121311 is 1131213130222.
2220313121311 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 2220313121311 - 27 = 2220313121183 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 (2220313121317) 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, 3309855 + ... + 3923743.
It is an arithmetic number, because the mean of its divisors is an integer number (277843544550).
Almost surely, 22220313121311 is an apocalyptic number.
2220313121311 is a deficient number, since it is larger than the sum of its proper divisors (2435235089).
2220313121311 is a wasteful number, since it uses less digits than its factorization.
2220313121311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 617849.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 2220313121311 its reverse (1131213130222), we get a palindrome (3351526251533).
The spelling of 2220313121311 in words is "two trillion, two hundred twenty billion, three hundred thirteen million, one hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •