Base | Representation |
---|---|
bin | 100110001110111… |
… | …101101001100101 |
3 | 1122201000101020002 |
4 | 212032331221211 |
5 | 2303203103431 |
6 | 143352351045 |
7 | 21616202162 |
oct | 4616755145 |
9 | 1581011202 |
10 | 641456741 |
11 | 2aa0a3a42 |
12 | 15a9a5485 |
13 | a2b82503 |
14 | 61299069 |
15 | 3b4ab3cb |
hex | 263bda65 |
641456741 has 2 divisors, whose sum is σ = 641456742. Its totient is φ = 641456740.
The previous prime is 641456719. The next prime is 641456759. The reversal of 641456741 is 147654146.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 630261025 + 11195716 = 25105^2 + 3346^2 .
It is a cyclic number.
It is not a de Polignac number, because 641456741 - 26 = 641456677 is a prime.
It is a super-2 number, since 2×6414567412 = 822933501148682162, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 641456695 and 641456704.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (641456341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 320728370 + 320728371.
It is an arithmetic number, because the mean of its divisors is an integer number (320728371).
Almost surely, 2641456741 is an apocalyptic number.
It is an amenable number.
641456741 is a deficient number, since it is larger than the sum of its proper divisors (1).
641456741 is an equidigital number, since it uses as much as digits as its factorization.
641456741 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 80640, while the sum is 38.
The square root of 641456741 is about 25326.9962885455. The cubic root of 641456741 is about 862.4272250016.
The spelling of 641456741 in words is "six hundred forty-one million, four hundred fifty-six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •