Base | Representation |
---|---|
bin | 1100110100011100… |
… | …1101101001111101 |
3 | 22212211021002200210 |
4 | 3031013031221331 |
5 | 24021423021341 |
6 | 1325245143033 |
7 | 151163614005 |
oct | 31507155175 |
9 | 8784232623 |
10 | 3441220221 |
11 | 150652a75a |
12 | 80055aa79 |
13 | 42ac28baa |
14 | 24905b005 |
15 | 15219ac16 |
hex | cd1cda7d |
3441220221 has 4 divisors (see below), whose sum is σ = 4588293632. Its totient is φ = 2294146812.
The previous prime is 3441220201. The next prime is 3441220271. The reversal of 3441220221 is 1220221443.
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 not a de Polignac number, because 3441220221 - 217 = 3441089149 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 (3441220201) 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, 573536701 + ... + 573536706.
It is an arithmetic number, because the mean of its divisors is an integer number (1147073408).
Almost surely, 23441220221 is an apocalyptic number.
It is an amenable number.
3441220221 is a deficient number, since it is larger than the sum of its proper divisors (1147073411).
3441220221 is a wasteful number, since it uses less digits than its factorization.
3441220221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1147073410.
The product of its (nonzero) digits is 768, while the sum is 21.
The square root of 3441220221 is about 58661.9145698468. The cubic root of 3441220221 is about 1509.7469308213.
Adding to 3441220221 its reverse (1220221443), we get a palindrome (4661441664).
The spelling of 3441220221 in words is "three billion, four hundred forty-one million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •