Base | Representation |
---|---|
bin | 110000011111010100… |
… | …1101100000110100001 |
3 | 100221210000120220021110 |
4 | 1200332221230012201 |
5 | 3201224331043131 |
6 | 115500430213533 |
7 | 10344306131652 |
oct | 1407651540641 |
9 | 327700526243 |
10 | 104130331041 |
11 | 40185947a30 |
12 | 182210542a9 |
13 | 9a864344c9 |
14 | 507b81d529 |
15 | 2a96b56646 |
hex | 183ea6c1a1 |
104130331041 has 16 divisors (see below), whose sum is σ = 159434000640. Its totient is φ = 59787749520.
The previous prime is 104130331021. The next prime is 104130331057. The reversal of 104130331041 is 140133031401.
It is not a de Polignac number, because 104130331041 - 26 = 104130330977 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 104130330999 and 104130331017.
It is not an unprimeable number, because it can be changed into a prime (104130331021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 83037915 + ... + 83039168.
It is an arithmetic number, because the mean of its divisors is an integer number (9964625040).
Almost surely, 2104130331041 is an apocalyptic number.
104130331041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
104130331041 is a deficient number, since it is larger than the sum of its proper divisors (55303669599).
104130331041 is a wasteful number, since it uses less digits than its factorization.
104130331041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166077116.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 104130331041 its reverse (140133031401), we get a palindrome (244263362442).
The spelling of 104130331041 in words is "one hundred four billion, one hundred thirty million, three hundred thirty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •