Base | Representation |
---|---|
bin | 110000101010101101… |
… | …0110101011100100011 |
3 | 100222202122100121011222 |
4 | 1201111122311130203 |
5 | 3203020123004443 |
6 | 120002353325255 |
7 | 10356625001231 |
oct | 1412532653443 |
9 | 328678317158 |
10 | 104512313123 |
11 | 403615267a9 |
12 | 18308b6682b |
13 | 9b176078ca |
14 | 50b6453951 |
15 | 2aba45b468 |
hex | 18556b5723 |
104512313123 has 8 divisors (see below), whose sum is σ = 104921346816. Its totient is φ = 104103368200.
The previous prime is 104512313041. The next prime is 104512313207. The reversal of 104512313123 is 321313215401.
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 104512313123 - 220 = 104511264547 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104512313092 and 104512313101.
It is not an unprimeable number, because it can be changed into a prime (104512313923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3300938 + ... + 3332448.
It is an arithmetic number, because the mean of its divisors is an integer number (13115168352).
Almost surely, 2104512313123 is an apocalyptic number.
104512313123 is a deficient number, since it is larger than the sum of its proper divisors (409033693).
104512313123 is a wasteful number, since it uses less digits than its factorization.
104512313123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44385.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 104512313123 its reverse (321313215401), we get a palindrome (425825528524).
The spelling of 104512313123 in words is "one hundred four billion, five hundred twelve million, three hundred thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •