Base | Representation |
---|---|
bin | 1000001111001000… |
… | …01110100100010101 |
3 | 102102011121000211201 |
4 | 10013210032210111 |
5 | 33024001422121 |
6 | 2010440432501 |
7 | 214402366216 |
oct | 40744164425 |
9 | 12364530751 |
10 | 4421904661 |
11 | 196a060469 |
12 | a34a78731 |
13 | 556162345 |
14 | 2dd3bb40d |
15 | 1ad313e91 |
hex | 10790e915 |
4421904661 has 4 divisors (see below), whose sum is σ = 4430392524. Its totient is φ = 4413416800.
The previous prime is 4421904649. The next prime is 4421904667. The reversal of 4421904661 is 1664091244.
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 1665129636 + 2756775025 = 40806^2 + 52505^2 .
It is a cyclic number.
It is not a de Polignac number, because 4421904661 - 217 = 4421773589 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4421904661.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4421904667) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4243150 + ... + 4244191.
It is an arithmetic number, because the mean of its divisors is an integer number (1107598131).
Almost surely, 24421904661 is an apocalyptic number.
It is an amenable number.
4421904661 is a deficient number, since it is larger than the sum of its proper divisors (8487863).
4421904661 is an equidigital number, since it uses as much as digits as its factorization.
4421904661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8487862.
The product of its (nonzero) digits is 41472, while the sum is 37.
The square root of 4421904661 is about 66497.4034154718. The cubic root of 4421904661 is about 1641.3572767790.
The spelling of 4421904661 in words is "four billion, four hundred twenty-one million, nine hundred four thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •