Base | Representation |
---|---|
bin | 110000111001000… |
… | …0101110011101101 |
3 | 11020022221002122212 |
4 | 1201302011303231 |
5 | 11324433132231 |
6 | 430442020205 |
7 | 55440124613 |
oct | 14162056355 |
9 | 4208832585 |
10 | 1640520941 |
11 | 772038734 |
12 | 3994a7665 |
13 | 201b52767 |
14 | 117c416b3 |
15 | 9905542b |
hex | 61c85ced |
1640520941 has 2 divisors, whose sum is σ = 1640520942. Its totient is φ = 1640520940.
The previous prime is 1640520913. The next prime is 1640520943. The reversal of 1640520941 is 1490250461.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1628445316 + 12075625 = 40354^2 + 3475^2 .
It is a cyclic number.
It is not a de Polignac number, because 1640520941 - 210 = 1640519917 is a prime.
Together with 1640520943, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1640520898 and 1640520907.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1640520943) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 820260470 + 820260471.
It is an arithmetic number, because the mean of its divisors is an integer number (820260471).
Almost surely, 21640520941 is an apocalyptic number.
It is an amenable number.
1640520941 is a deficient number, since it is larger than the sum of its proper divisors (1).
1640520941 is an equidigital number, since it uses as much as digits as its factorization.
1640520941 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8640, while the sum is 32.
The square root of 1640520941 is about 40503.3448124967. The cubic root of 1640520941 is about 1179.3985590082.
It can be divided in two parts, 1640520 and 941, that added together give a palindrome (1641461).
The spelling of 1640520941 in words is "one billion, six hundred forty million, five hundred twenty thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •