Base | Representation |
---|---|
bin | 111110101101101… |
… | …1011101101101001 |
3 | 12102122200201110111 |
4 | 1331123123231221 |
5 | 13302202442101 |
6 | 544451214321 |
7 | 103101423646 |
oct | 17533335551 |
9 | 5378621414 |
10 | 2104343401 |
11 | 98a935386 |
12 | 4a88a73a1 |
13 | 276c7bb14 |
14 | 15d69adcd |
15 | c4b24251 |
hex | 7d6dbb69 |
2104343401 has 2 divisors, whose sum is σ = 2104343402. Its totient is φ = 2104343400.
The previous prime is 2104343363. The next prime is 2104343407. The reversal of 2104343401 is 1043434012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1390171225 + 714172176 = 37285^2 + 26724^2 .
It is a cyclic number.
It is not a de Polignac number, because 2104343401 - 217 = 2104212329 is a prime.
It is a super-2 number, since 2×21043434012 = 8856522298664493602, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2104343407) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1052171700 + 1052171701.
It is an arithmetic number, because the mean of its divisors is an integer number (1052171701).
Almost surely, 22104343401 is an apocalyptic number.
It is an amenable number.
2104343401 is a deficient number, since it is larger than the sum of its proper divisors (1).
2104343401 is an equidigital number, since it uses as much as digits as its factorization.
2104343401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 2104343401 is about 45873.1228607776. The cubic root of 2104343401 is about 1281.4614250789.
Adding to 2104343401 its reverse (1043434012), we get a palindrome (3147777413).
It can be divided in two parts, 2 and 104343401, that multiplied together give a palindrome (208686802).
The spelling of 2104343401 in words is "two billion, one hundred four million, three hundred forty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •