Base | Representation |
---|---|
bin | 100110001110001… |
… | …101100110110001 |
3 | 1122200122101021122 |
4 | 212032031212301 |
5 | 2303130304303 |
6 | 143344232025 |
7 | 21614422355 |
oct | 4616154661 |
9 | 1580571248 |
10 | 641259953 |
11 | 2a9a7a104 |
12 | 15a90b615 |
13 | a2b13a79 |
14 | 61247465 |
15 | 3b46ce38 |
hex | 2638d9b1 |
641259953 has 2 divisors, whose sum is σ = 641259954. Its totient is φ = 641259952.
The previous prime is 641259947. The next prime is 641259979. The reversal of 641259953 is 359952146.
641259953 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 391367089 + 249892864 = 19783^2 + 15808^2 .
It is a cyclic number.
It is not a de Polignac number, because 641259953 - 26 = 641259889 is a prime.
It is a super-2 number, since 2×6412599532 = 822428654643124418, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (641253953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 320629976 + 320629977.
It is an arithmetic number, because the mean of its divisors is an integer number (320629977).
Almost surely, 2641259953 is an apocalyptic number.
It is an amenable number.
641259953 is a deficient number, since it is larger than the sum of its proper divisors (1).
641259953 is an equidigital number, since it uses as much as digits as its factorization.
641259953 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 291600, while the sum is 44.
The square root of 641259953 is about 25323.1110450513. Note that the first 3 decimals coincide. The cubic root of 641259953 is about 862.3390233214.
The spelling of 641259953 in words is "six hundred forty-one million, two hundred fifty-nine thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •