Base | Representation |
---|---|
bin | 111110101101101… |
… | …1011111001100001 |
3 | 12102122200202111122 |
4 | 1331123123321201 |
5 | 13302203003121 |
6 | 544451222025 |
7 | 103101426113 |
oct | 17533337141 |
9 | 5378622448 |
10 | 2104344161 |
11 | 98a935a07 |
12 | 4a88a7915 |
13 | 276c7c27a |
14 | 15d69b3b3 |
15 | c4b245ab |
hex | 7d6dbe61 |
2104344161 has 2 divisors, whose sum is σ = 2104344162. Its totient is φ = 2104344160.
The previous prime is 2104344157. The next prime is 2104344163. The reversal of 2104344161 is 1614434012.
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., 2072070400 + 32273761 = 45520^2 + 5681^2 .
It is a cyclic number.
It is not a de Polignac number, because 2104344161 - 22 = 2104344157 is a prime.
Together with 2104344163, 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 2104344161.
It is not a weakly prime, because it can be changed into another prime (2104344163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1052172080 + 1052172081.
It is an arithmetic number, because the mean of its divisors is an integer number (1052172081).
Almost surely, 22104344161 is an apocalyptic number.
It is an amenable number.
2104344161 is a deficient number, since it is larger than the sum of its proper divisors (1).
2104344161 is an equidigital number, since it uses as much as digits as its factorization.
2104344161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2304, while the sum is 26.
The square root of 2104344161 is about 45873.1311444946. The cubic root of 2104344161 is about 1281.4615793488.
Adding to 2104344161 its reverse (1614434012), we get a palindrome (3718778173).
The spelling of 2104344161 in words is "two billion, one hundred four million, three hundred forty-four thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •