Base | Representation |
---|---|
bin | 100000010011110100010… |
… | …001010110000011010101 |
3 | 21212020222121122001100211 |
4 | 200103310101112003111 |
5 | 242334134113442323 |
6 | 4415554202405421 |
7 | 316261064522155 |
oct | 40236421260325 |
9 | 7766877561324 |
10 | 2220301312213 |
11 | 786696231366 |
12 | 2ba386500871 |
13 | 1314b17c830a |
14 | 7966ac8c765 |
15 | 3cb4d88a70d |
hex | 204f44560d5 |
2220301312213 has 8 divisors (see below), whose sum is σ = 2224496016000. Its totient is φ = 2216108236368.
The previous prime is 2220301312147. The next prime is 2220301312253. The reversal of 2220301312213 is 3122131030222.
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 2220301312213 - 221 = 2220299215061 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 (2220301312253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2340823 + ... + 3149611.
It is an arithmetic number, because the mean of its divisors is an integer number (278062002000).
Almost surely, 22220301312213 is an apocalyptic number.
It is an amenable number.
2220301312213 is a deficient number, since it is larger than the sum of its proper divisors (4194703787).
2220301312213 is an equidigital number, since it uses as much as digits as its factorization.
2220301312213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 813971.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 2220301312213 its reverse (3122131030222), we get a palindrome (5342432342435).
The spelling of 2220301312213 in words is "two trillion, two hundred twenty billion, three hundred one million, three hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •