Base | Representation |
---|---|
bin | 1111101110011100… |
… | …0111011010110101 |
3 | 101220012012001021221 |
4 | 3323213013122311 |
5 | 32121130211341 |
6 | 1534513510341 |
7 | 206415520525 |
oct | 37347073265 |
9 | 11805161257 |
10 | 4221335221 |
11 | 18769196a4 |
12 | 9998723b1 |
13 | 523738abc |
14 | 2c08cb685 |
15 | 19a8e5ed1 |
hex | fb9c76b5 |
4221335221 has 8 divisors (see below), whose sum is σ = 4316765184. Its totient is φ = 4126139280.
The previous prime is 4221335213. The next prime is 4221335233. The reversal of 4221335221 is 1225331224.
4221335221 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 4221335221 - 23 = 4221335213 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 (4221335021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21765 + ... + 94426.
It is an arithmetic number, because the mean of its divisors is an integer number (539595648).
Almost surely, 24221335221 is an apocalyptic number.
It is an amenable number.
4221335221 is a deficient number, since it is larger than the sum of its proper divisors (95429963).
4221335221 is a wasteful number, since it uses less digits than its factorization.
4221335221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117011.
The product of its digits is 2880, while the sum is 25.
The square root of 4221335221 is about 64971.8032764983. The cubic root of 4221335221 is about 1616.1560058203.
Adding to 4221335221 its reverse (1225331224), we get a palindrome (5446666445).
The spelling of 4221335221 in words is "four billion, two hundred twenty-one million, three hundred thirty-five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •