Base | Representation |
---|---|
bin | 100110001111010… |
… | …101001100100101 |
3 | 1122201012021112020 |
4 | 212033111030211 |
5 | 2303214200224 |
6 | 143354413353 |
7 | 21620053314 |
oct | 4617251445 |
9 | 1581167466 |
10 | 641553189 |
11 | 2aa15a452 |
12 | 15aa31259 |
13 | a2bb7394 |
14 | 612c227b |
15 | 3b4c9c79 |
hex | 263d5325 |
641553189 has 4 divisors (see below), whose sum is σ = 855404256. Its totient is φ = 427702124.
The previous prime is 641553179. The next prime is 641553223. The reversal of 641553189 is 981355146.
641553189 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 a cyclic number.
It is not a de Polignac number, because 641553189 - 212 = 641549093 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 641553189.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (641553139) 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, 106925529 + ... + 106925534.
It is an arithmetic number, because the mean of its divisors is an integer number (213851064).
Almost surely, 2641553189 is an apocalyptic number.
It is an amenable number.
641553189 is a deficient number, since it is larger than the sum of its proper divisors (213851067).
641553189 is a wasteful number, since it uses less digits than its factorization.
641553189 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213851066.
The product of its digits is 129600, while the sum is 42.
The square root of 641553189 is about 25328.9002722187. The cubic root of 641553189 is about 862.4704470445.
The spelling of 641553189 in words is "six hundred forty-one million, five hundred fifty-three thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •