Base | Representation |
---|---|
bin | 10111101011010011101010… |
… | …011011111011011100001011 |
3 | 111122200211121211000022220100 |
4 | 113223103222123323130023 |
5 | 102122041013300022443 |
6 | 1005245102024100443 |
7 | 30635140143343560 |
oct | 2753235233733413 |
9 | 448624554008810 |
10 | 104131120314123 |
11 | 301a783a7a7511 |
12 | b819385604723 |
13 | 46146a3c5a266 |
14 | 1b9dd8a326867 |
15 | c08a51b383d3 |
hex | 5eb4ea6fb70b |
104131120314123 has 96 divisors (see below), whose sum is σ = 173729819394560. Its totient is φ = 58873194593280.
The previous prime is 104131120314083. The next prime is 104131120314139. The reversal of 104131120314123 is 321413021131401.
104131120314123 is a `hidden beast` number, since 1 + 0 + 4 + 1 + 311 + 20 + 314 + 12 + 3 = 666.
It is not a de Polignac number, because 104131120314123 - 212 = 104131120310027 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104131120334123) 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 95 ways as a sum of consecutive naturals, for example, 10441298565 + ... + 10441308537.
Almost surely, 2104131120314123 is an apocalyptic number.
104131120314123 is a deficient number, since it is larger than the sum of its proper divisors (69598699080437).
104131120314123 is a wasteful number, since it uses less digits than its factorization.
104131120314123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14609 (or 14606 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
Adding to 104131120314123 its reverse (321413021131401), we get a palindrome (425544141445524).
The spelling of 104131120314123 in words is "one hundred four trillion, one hundred thirty-one billion, one hundred twenty million, three hundred fourteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •