Base | Representation |
---|---|
bin | 11110100111110100110… |
… | …000101011111101100101 |
3 | 21110011200110010222001211 |
4 | 132213310300223331211 |
5 | 233434144411131204 |
6 | 4250420053151421 |
7 | 305014432603402 |
oct | 36476460537545 |
9 | 7404613128054 |
10 | 2104345411429 |
11 | 7414a21408a8 |
12 | 29ba0502b571 |
13 | 123592402c81 |
14 | 73bcaa992a9 |
15 | 39b1396b804 |
hex | 1e9f4c2bf65 |
2104345411429 has 2 divisors, whose sum is σ = 2104345411430. Its totient is φ = 2104345411428.
The previous prime is 2104345411387. The next prime is 2104345411453. The reversal of 2104345411429 is 9241145434012.
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., 1724827808929 + 379517602500 = 1313327^2 + 616050^2 .
It is a cyclic number.
It is not a de Polignac number, because 2104345411429 - 29 = 2104345410917 is a prime.
It is a super-2 number, since 2×21043454114292 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2104345411391 and 2104345411400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2104345411489) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1052172705714 + 1052172705715.
It is an arithmetic number, because the mean of its divisors is an integer number (1052172705715).
Almost surely, 22104345411429 is an apocalyptic number.
It is an amenable number.
2104345411429 is a deficient number, since it is larger than the sum of its proper divisors (1).
2104345411429 is an equidigital number, since it uses as much as digits as its factorization.
2104345411429 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 138240, while the sum is 40.
The spelling of 2104345411429 in words is "two trillion, one hundred four billion, three hundred forty-five million, four hundred eleven thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •