Base | Representation |
---|---|
bin | 100110001111000… |
… | …000000001111101 |
3 | 1122201000212121021 |
4 | 212033000001331 |
5 | 2303203411433 |
6 | 143352504141 |
7 | 21616242463 |
oct | 4617000175 |
9 | 1581025537 |
10 | 641466493 |
11 | 2aa1002a8 |
12 | 15a9ab051 |
13 | a2b86a95 |
14 | 6129c833 |
15 | 3b4ae22d |
hex | 263c007d |
641466493 has 2 divisors, whose sum is σ = 641466494. Its totient is φ = 641466492.
The previous prime is 641466439. The next prime is 641466503. The reversal of 641466493 is 394664146.
Together with previous prime (641466439) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 617671609 + 23794884 = 24853^2 + 4878^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-641466493 is a prime.
It is a super-2 number, since 2×6414664932 = 822958523283438098, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (641466893) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 320733246 + 320733247.
It is an arithmetic number, because the mean of its divisors is an integer number (320733247).
Almost surely, 2641466493 is an apocalyptic number.
It is an amenable number.
641466493 is a deficient number, since it is larger than the sum of its proper divisors (1).
641466493 is an equidigital number, since it uses as much as digits as its factorization.
641466493 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 373248, while the sum is 43.
The square root of 641466493 is about 25327.1888096567. The cubic root of 641466493 is about 862.4315954432.
The spelling of 641466493 in words is "six hundred forty-one million, four hundred sixty-six thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •