Base | Representation |
---|---|
bin | 1011111111101101… |
… | …1100001100000101 |
3 | 22022102001111001021 |
4 | 2333323130030011 |
5 | 23043311431323 |
6 | 1251304231141 |
7 | 142536543121 |
oct | 27773341405 |
9 | 8272044037 |
10 | 3220030213 |
11 | 14026943a4 |
12 | 75a46b4b1 |
13 | 3c416292a |
14 | 227920581 |
15 | 13ca5805d |
hex | bfedc305 |
3220030213 has 4 divisors (see below), whose sum is σ = 3221575200. Its totient is φ = 3218485228.
The previous prime is 3220030193. The next prime is 3220030223. The reversal of 3220030213 is 3120300223.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3220030213 - 217 = 3219899141 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 (3220030223) 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, 769363 + ... + 773536.
It is an arithmetic number, because the mean of its divisors is an integer number (805393800).
Almost surely, 23220030213 is an apocalyptic number.
It is an amenable number.
3220030213 is a deficient number, since it is larger than the sum of its proper divisors (1544987).
3220030213 is a wasteful number, since it uses less digits than its factorization.
3220030213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1544986.
The product of its (nonzero) digits is 216, while the sum is 16.
The square root of 3220030213 is about 56745.3100529022. The cubic root of 3220030213 is about 1476.6808704297.
Adding to 3220030213 its reverse (3120300223), we get a palindrome (6340330436).
The spelling of 3220030213 in words is "three billion, two hundred twenty million, thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •