Base | Representation |
---|---|
bin | 1100011010011… |
… | …00011100000001 |
3 | 21020220221200120 |
4 | 12031030130001 |
5 | 203123401423 |
6 | 14155410453 |
7 | 2403011004 |
oct | 615143401 |
9 | 236827616 |
10 | 104122113 |
11 | 53857537 |
12 | 2aa53a29 |
13 | 18757b24 |
14 | db8553b |
15 | 921aee3 |
hex | 634c701 |
104122113 has 4 divisors (see below), whose sum is σ = 138829488. Its totient is φ = 69414740.
The previous prime is 104122103. The next prime is 104122121. The reversal of 104122113 is 311221401.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 104122113 - 221 = 102024961 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104122092 and 104122101.
It is not an unprimeable number, because it can be changed into a prime (104122103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17353683 + ... + 17353688.
It is an arithmetic number, because the mean of its divisors is an integer number (34707372).
Almost surely, 2104122113 is an apocalyptic number.
It is an amenable number.
104122113 is a deficient number, since it is larger than the sum of its proper divisors (34707375).
104122113 is an equidigital number, since it uses as much as digits as its factorization.
104122113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34707374.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 104122113 is about 10204.0243531658. The cubic root of 104122113 is about 470.4509223053.
Adding to 104122113 its reverse (311221401), we get a palindrome (415343514).
The spelling of 104122113 in words is "one hundred four million, one hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •