Base | Representation |
---|---|
bin | 1101011101011010… |
… | …1111101110000101 |
3 | 100022210121200010202 |
4 | 3113112233232011 |
5 | 24344421022234 |
6 | 1354304300245 |
7 | 155351352326 |
oct | 32726575605 |
9 | 10283550122 |
10 | 3613064069 |
11 | 159453156a |
12 | 84a011685 |
13 | 457705544 |
14 | 263bd044d |
15 | 1622e277e |
hex | d75afb85 |
3613064069 has 2 divisors, whose sum is σ = 3613064070. Its totient is φ = 3613064068.
The previous prime is 3613064017. The next prime is 3613064071. The reversal of 3613064069 is 9604603163.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2985311044 + 627753025 = 54638^2 + 25055^2 .
It is an emirp because it is prime and its reverse (9604603163) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3613064069 is a prime.
It is a super-2 number, since 2×36130640692 = 26108463933397673522, which contains 22 as substring.
Together with 3613064071, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3613064269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1806532034 + 1806532035.
It is an arithmetic number, because the mean of its divisors is an integer number (1806532035).
Almost surely, 23613064069 is an apocalyptic number.
It is an amenable number.
3613064069 is a deficient number, since it is larger than the sum of its proper divisors (1).
3613064069 is an equidigital number, since it uses as much as digits as its factorization.
3613064069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 69984, while the sum is 38.
The square root of 3613064069 is about 60108.7686531674. The cubic root of 3613064069 is about 1534.4705377213.
The spelling of 3613064069 in words is "three billion, six hundred thirteen million, sixty-four thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •