Base | Representation |
---|---|
bin | 10111101010100000101101… |
… | …100010011010100100100001 |
3 | 111122111121102001202021122101 |
4 | 113222200231202122210201 |
5 | 102120141442321404441 |
6 | 1005204013212410401 |
7 | 30631162333246165 |
oct | 2752405542324441 |
9 | 448447361667571 |
10 | 104076411513121 |
11 | 3018661603a593 |
12 | b80a857776a01 |
13 | 460c495797868 |
14 | 1b9b47a496ca5 |
15 | c073edbad231 |
hex | 5ea82d89a921 |
104076411513121 has 4 divisors (see below), whose sum is σ = 110198553366852. Its totient is φ = 97954269659392.
The previous prime is 104076411513097. The next prime is 104076411513167. The reversal of 104076411513121 is 121315114670401.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 88396870645521 + 15679540867600 = 9401961^2 + 3959740^2 .
It is a cyclic number.
It is not a de Polignac number, because 104076411513121 - 29 = 104076411512609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104076411513521) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3061070926840 + ... + 3061070926873.
It is an arithmetic number, because the mean of its divisors is an integer number (27549638341713).
Almost surely, 2104076411513121 is an apocalyptic number.
It is an amenable number.
104076411513121 is a deficient number, since it is larger than the sum of its proper divisors (6122141853731).
104076411513121 is an equidigital number, since it uses as much as digits as its factorization.
104076411513121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6122141853730.
The product of its (nonzero) digits is 20160, while the sum is 37.
The spelling of 104076411513121 in words is "one hundred four trillion, seventy-six billion, four hundred eleven million, five hundred thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •