Base | Representation |
---|---|
bin | 1011100100001010… |
… | …0000001011101101 |
3 | 22000100112221112212 |
4 | 2321002200023231 |
5 | 22324214103234 |
6 | 1232014540205 |
7 | 136634212412 |
oct | 27102401355 |
9 | 8010487485 |
10 | 3104441069 |
11 | 1353415584 |
12 | 727807665 |
13 | 3a62215a2 |
14 | 216432109 |
15 | 1328245ce |
hex | b90a02ed |
3104441069 has 2 divisors, whose sum is σ = 3104441070. Its totient is φ = 3104441068.
The previous prime is 3104441057. The next prime is 3104441071. The reversal of 3104441069 is 9601444013.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2305248169 + 799192900 = 48013^2 + 28270^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3104441069 is a prime.
It is a super-2 number, since 2×31044410692 = 19275108701787725522, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 3104441071, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3104441089) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1552220534 + 1552220535.
It is an arithmetic number, because the mean of its divisors is an integer number (1552220535).
Almost surely, 23104441069 is an apocalyptic number.
It is an amenable number.
3104441069 is a deficient number, since it is larger than the sum of its proper divisors (1).
3104441069 is an equidigital number, since it uses as much as digits as its factorization.
3104441069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 32.
The square root of 3104441069 is about 55717.5113317169. The cubic root of 3104441069 is about 1458.7956962257.
The spelling of 3104441069 in words is "three billion, one hundred four million, four hundred forty-one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •