Base | Representation |
---|---|
bin | 1011100101100110… |
… | …01010001111011101 |
3 | 121001112212120220121 |
4 | 11302303022033131 |
5 | 100220032344323 |
6 | 2505145114541 |
7 | 310106316316 |
oct | 56263121735 |
9 | 17045776817 |
10 | 6220981213 |
11 | 2702644297 |
12 | 1257488a51 |
13 | 781abac95 |
14 | 4302d360d |
15 | 266238a5d |
hex | 172cca3dd |
6220981213 has 4 divisors (see below), whose sum is σ = 6221196828. Its totient is φ = 6220765600.
The previous prime is 6220981187. The next prime is 6220981237. The reversal of 6220981213 is 3121890226.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4487258169 + 1733723044 = 66987^2 + 41638^2 .
It is a cyclic number.
It is not a de Polignac number, because 6220981213 - 213 = 6220973021 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 (6220981813) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 56338 + ... + 124963.
It is an arithmetic number, because the mean of its divisors is an integer number (1555299207).
Almost surely, 26220981213 is an apocalyptic number.
It is an amenable number.
6220981213 is a deficient number, since it is larger than the sum of its proper divisors (215615).
6220981213 is a wasteful number, since it uses less digits than its factorization.
6220981213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215614.
The product of its (nonzero) digits is 10368, while the sum is 34.
The square root of 6220981213 is about 78873.1970507092. The cubic root of 6220981213 is about 1839.1604957541.
The spelling of 6220981213 in words is "six billion, two hundred twenty million, nine hundred eighty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •