Base | Representation |
---|---|
bin | 110000100100110111… |
… | …0000000011111110001 |
3 | 100222020221222111101121 |
4 | 1201021232000133301 |
5 | 3202114344400104 |
6 | 115531102102241 |
7 | 10352022322261 |
oct | 1411156003761 |
9 | 328227874347 |
10 | 104316012529 |
11 | 40270740203 |
12 | 1827327a981 |
13 | 9ab5a47401 |
14 | 50983557a1 |
15 | 2aa80d3254 |
hex | 1849b807f1 |
104316012529 has 8 divisors (see below), whose sum is σ = 105755710280. Its totient is φ = 102876604416.
The previous prime is 104316012517. The next prime is 104316012539. The reversal of 104316012529 is 925210613401.
It can be written as a sum of positive squares in 4 ways, for example, as 12899280625 + 91416731904 = 113575^2 + 302352^2 .
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 104316012529 - 211 = 104316010481 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104316012494 and 104316012503.
It is not an unprimeable number, because it can be changed into a prime (104316012539) 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 7 ways as a sum of consecutive naturals, for example, 710917 + ... + 845005.
It is an arithmetic number, because the mean of its divisors is an integer number (13219463785).
Almost surely, 2104316012529 is an apocalyptic number.
It is an amenable number.
104316012529 is a deficient number, since it is larger than the sum of its proper divisors (1439697751).
104316012529 is a wasteful number, since it uses less digits than its factorization.
104316012529 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144819.
The product of its (nonzero) digits is 12960, while the sum is 34.
The spelling of 104316012529 in words is "one hundred four billion, three hundred sixteen million, twelve thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •