Base | Representation |
---|---|
bin | 110000000100111… |
… | …1100101100100001 |
3 | 11011102120002200122 |
4 | 1200021330230201 |
5 | 11300441030031 |
6 | 424024530025 |
7 | 54656102114 |
oct | 14011745441 |
9 | 4142502618 |
10 | 1613220641 |
11 | 7586915aa |
12 | 390320915 |
13 | 1c92b4536 |
14 | 11437657b |
15 | 9696147b |
hex | 6027cb21 |
1613220641 has 2 divisors, whose sum is σ = 1613220642. Its totient is φ = 1613220640.
The previous prime is 1613220629. The next prime is 1613220643. The reversal of 1613220641 is 1460223161.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1379008225 + 234212416 = 37135^2 + 15304^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1613220641 is a prime.
Together with 1613220643, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1613220641.
It is not a weakly prime, because it can be changed into another prime (1613220643) 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, 806610320 + 806610321.
It is an arithmetic number, because the mean of its divisors is an integer number (806610321).
Almost surely, 21613220641 is an apocalyptic number.
It is an amenable number.
1613220641 is a deficient number, since it is larger than the sum of its proper divisors (1).
1613220641 is an equidigital number, since it uses as much as digits as its factorization.
1613220641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 26.
The square root of 1613220641 is about 40164.9180380092. The cubic root of 1613220641 is about 1172.8197120213.
The spelling of 1613220641 in words is "one billion, six hundred thirteen million, two hundred twenty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •