Base | Representation |
---|---|
bin | 10010101010100011110… |
… | …00001011111110000001 |
3 | 2021022100221220010212020 |
4 | 21111101320023332001 |
5 | 41001412343420224 |
6 | 1210341534552053 |
7 | 64222413306132 |
oct | 11252170137601 |
9 | 2238327803766 |
10 | 641323810689 |
11 | 227a90632161 |
12 | a4362068629 |
13 | 486270637b3 |
14 | 2307c5adc89 |
15 | 11a37b99c79 |
hex | 9551e0bf81 |
641323810689 has 32 divisors (see below), whose sum is σ = 900427449600. Its totient is φ = 405226364928.
The previous prime is 641323810679. The next prime is 641323810703. The reversal of 641323810689 is 986018323146.
It is not a de Polignac number, because 641323810689 - 211 = 641323808641 is a prime.
It is a super-2 number, since 2×6413238106892 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (641323810679) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 33899697 + ... + 33918609.
It is an arithmetic number, because the mean of its divisors is an integer number (28138357800).
Almost surely, 2641323810689 is an apocalyptic number.
641323810689 is a gapful number since it is divisible by the number (69) formed by its first and last digit.
It is an amenable number.
641323810689 is a deficient number, since it is larger than the sum of its proper divisors (259103638911).
641323810689 is a wasteful number, since it uses less digits than its factorization.
641323810689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23401.
The product of its (nonzero) digits is 1492992, while the sum is 51.
The spelling of 641323810689 in words is "six hundred forty-one billion, three hundred twenty-three million, eight hundred ten thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •