Base | Representation |
---|---|
bin | 100110001110000… |
… | …111110111000110 |
3 | 1122200121012000010 |
4 | 212032013313012 |
5 | 2303124031142 |
6 | 143343531050 |
7 | 21614263641 |
oct | 4616076706 |
9 | 1580535003 |
10 | 641236422 |
11 | 2a9a63462 |
12 | 15a8b9a86 |
13 | a2b06148 |
14 | 6123ca58 |
15 | 3b465e9c |
hex | 26387dc6 |
641236422 has 8 divisors (see below), whose sum is σ = 1282472856. Its totient is φ = 213745472.
The previous prime is 641236417. The next prime is 641236423. The reversal of 641236422 is 224632146.
It is a sphenic number, since it is the product of 3 distinct primes.
641236422 is an admirable number.
It is a super-2 number, since 2×6412364222 = 822368297798724168, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 641236422.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (641236423) 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, 53436363 + ... + 53436374.
It is an arithmetic number, because the mean of its divisors is an integer number (160309107).
Almost surely, 2641236422 is an apocalyptic number.
641236422 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
641236422 is a wasteful number, since it uses less digits than its factorization.
641236422 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106872742.
The product of its digits is 13824, while the sum is 30.
The square root of 641236422 is about 25322.6464256799. The cubic root of 641236422 is about 862.3284753641.
Adding to 641236422 its reverse (224632146), we get a palindrome (865868568).
The spelling of 641236422 in words is "six hundred forty-one million, two hundred thirty-six thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •