Base | Representation |
---|---|
bin | 100000010100001001110… |
… | …1110001010011101000001 |
3 | 120201120211201101212101002 |
4 | 1000220103232022131001 |
5 | 1040231314211140414 |
6 | 13240152324221345 |
7 | 635606140030016 |
oct | 100502356123501 |
9 | 16646751355332 |
10 | 4441327052609 |
11 | 14626133772a7 |
12 | 5b891353a855 |
13 | 262a7a406855 |
14 | 114d6603370d |
15 | 7a7e0b214de |
hex | 40a13b8a741 |
4441327052609 has 4 divisors (see below), whose sum is σ = 4443529001604. Its totient is φ = 4439125103616.
The previous prime is 4441327052599. The next prime is 4441327052611. The reversal of 4441327052609 is 9062507231444.
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 3697717473025 + 743609579584 = 1922945^2 + 862328^2 .
It is a cyclic number.
It is not a de Polignac number, because 4441327052609 - 24 = 4441327052593 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4441327012609) 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 3 ways as a sum of consecutive naturals, for example, 1100971472 + ... + 1100975505.
It is an arithmetic number, because the mean of its divisors is an integer number (1110882250401).
Almost surely, 24441327052609 is an apocalyptic number.
It is an amenable number.
4441327052609 is a deficient number, since it is larger than the sum of its proper divisors (2201948995).
4441327052609 is a wasteful number, since it uses less digits than its factorization.
4441327052609 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2201948994.
The product of its (nonzero) digits is 1451520, while the sum is 47.
The spelling of 4441327052609 in words is "four trillion, four hundred forty-one billion, three hundred twenty-seven million, fifty-two thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •