Base | Representation |
---|---|
bin | 10111101101111011100101… |
… | …010000101101010101110111 |
3 | 111200100002000100122201120111 |
4 | 113231323211100231111313 |
5 | 102133014243030110033 |
6 | 1005504001125243451 |
7 | 30654152165345320 |
oct | 2755734520552567 |
9 | 450302010581514 |
10 | 104311422113143 |
11 | 30267253431773 |
12 | b848304263587 |
13 | 46286a927c3bb |
14 | 1ba89b2243447 |
15 | c0d5a5aa87cd |
hex | 5edee542d577 |
104311422113143 has 16 divisors (see below), whose sum is σ = 121110543146560. Its totient is φ = 87992033550336.
The previous prime is 104311422113089. The next prime is 104311422113147. The reversal of 104311422113143 is 341311224113401.
It is a cyclic number.
It is not a de Polignac number, because 104311422113143 - 217 = 104311421982071 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104311422113147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 223105578 + ... + 223572631.
It is an arithmetic number, because the mean of its divisors is an integer number (7569408946660).
Almost surely, 2104311422113143 is an apocalyptic number.
104311422113143 is a deficient number, since it is larger than the sum of its proper divisors (16799121033417).
104311422113143 is an equidigital number, since it uses as much as digits as its factorization.
104311422113143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 446678746.
The product of its (nonzero) digits is 6912, while the sum is 31.
Adding to 104311422113143 its reverse (341311224113401), we get a palindrome (445622646226544).
The spelling of 104311422113143 in words is "one hundred four trillion, three hundred eleven billion, four hundred twenty-two million, one hundred thirteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •