Base | Representation |
---|---|
bin | 100111100110100… |
… | …001110000000101 |
3 | 1201022012120202001 |
4 | 213212201300011 |
5 | 2330042124031 |
6 | 145532345301 |
7 | 22315254502 |
oct | 4746416005 |
9 | 1638176661 |
10 | 664411141 |
11 | 311051a19 |
12 | 166615231 |
13 | a785b5b4 |
14 | 643524a9 |
15 | 3d4e2861 |
hex | 279a1c05 |
664411141 has 4 divisors (see below), whose sum is σ = 687321900. Its totient is φ = 641500384.
The previous prime is 664411123. The next prime is 664411151. The reversal of 664411141 is 141114466.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 141114466 = 2 ⋅70557233.
It can be written as a sum of positive squares in 2 ways, for example, as 342065025 + 322346116 = 18495^2 + 17954^2 .
It is a cyclic number.
It is not a de Polignac number, because 664411141 - 227 = 530193413 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 (664411151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11455336 + ... + 11455393.
It is an arithmetic number, because the mean of its divisors is an integer number (171830475).
Almost surely, 2664411141 is an apocalyptic number.
It is an amenable number.
664411141 is a deficient number, since it is larger than the sum of its proper divisors (22910759).
664411141 is a wasteful number, since it uses less digits than its factorization.
664411141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22910758.
The product of its digits is 2304, while the sum is 28.
The square root of 664411141 is about 25776.1739014928. The cubic root of 664411141 is about 872.5941600007.
The spelling of 664411141 in words is "six hundred sixty-four million, four hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •