Base | Representation |
---|---|
bin | 1100000000101010… |
… | …1100111111101101 |
3 | 22022200120202101110 |
4 | 3000022230333231 |
5 | 23100322444323 |
6 | 1251530102233 |
7 | 142615545624 |
oct | 30012547755 |
9 | 8280522343 |
10 | 3224031213 |
11 | 1404977407 |
12 | 75b87a979 |
13 | 3c4c33aa0 |
14 | 2282826bb |
15 | 13d098793 |
hex | c02acfed |
3224031213 has 8 divisors (see below), whose sum is σ = 4629378208. Its totient is φ = 1984019184.
The previous prime is 3224031211. The next prime is 3224031241. The reversal of 3224031213 is 3121304223.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3224031213 - 21 = 3224031211 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3224031213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3224031211) 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, 41333695 + ... + 41333772.
It is an arithmetic number, because the mean of its divisors is an integer number (578672276).
Almost surely, 23224031213 is an apocalyptic number.
It is an amenable number.
3224031213 is a deficient number, since it is larger than the sum of its proper divisors (1405346995).
3224031213 is a wasteful number, since it uses less digits than its factorization.
3224031213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82667483.
The product of its (nonzero) digits is 864, while the sum is 21.
The square root of 3224031213 is about 56780.5531234066. The cubic root of 3224031213 is about 1477.2922264742.
Adding to 3224031213 its reverse (3121304223), we get a palindrome (6345335436).
The spelling of 3224031213 in words is "three billion, two hundred twenty-four million, thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •