Base | Representation |
---|---|
bin | 10111101011000000111100… |
… | …111101111101100101100001 |
3 | 111122121220202200210021201110 |
4 | 113223000330331331211201 |
5 | 102121223342203143131 |
6 | 1005231540313453533 |
7 | 30633526244532333 |
oct | 2753007475754541 |
9 | 448556680707643 |
10 | 104111030131041 |
11 | 3019a27038161a |
12 | b8154b94112a9 |
13 | 461282199826b |
14 | 1b9d002087453 |
15 | c08278006646 |
hex | 5eb03cf7d961 |
104111030131041 has 8 divisors (see below), whose sum is σ = 138814836580224. Its totient is φ = 69407288551280.
The previous prime is 104111030131039. The next prime is 104111030131057. The reversal of 104111030131041 is 140131030111401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 104111030131041 - 21 = 104111030131039 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104111030130999 and 104111030131017.
It is not an unprimeable number, because it can be changed into a prime (104111030131001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12340086 + ... + 18986831.
It is an arithmetic number, because the mean of its divisors is an integer number (17351854572528).
Almost surely, 2104111030131041 is an apocalyptic number.
It is an amenable number.
104111030131041 is a deficient number, since it is larger than the sum of its proper divisors (34703806449183).
104111030131041 is a wasteful number, since it uses less digits than its factorization.
104111030131041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32434711.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 104111030131041 its reverse (140131030111401), we get a palindrome (244242060242442).
The spelling of 104111030131041 in words is "one hundred four trillion, one hundred eleven billion, thirty million, one hundred thirty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •