Base | Representation |
---|---|
bin | 110000011111011100… |
… | …0011111001001001001 |
3 | 100221210021212222101002 |
4 | 1200332320133021021 |
5 | 3201231324210441 |
6 | 115501045304345 |
7 | 10344354116144 |
oct | 1407670371111 |
9 | 327707788332 |
10 | 104134210121 |
11 | 40188057387 |
12 | 182224050b5 |
13 | 9a87192016 |
14 | 507c14d05b |
15 | 2a97170b9b |
hex | 183ee1f249 |
104134210121 has 8 divisors (see below), whose sum is σ = 104541776064. Its totient is φ = 103726732720.
The previous prime is 104134210111. The next prime is 104134210151. The reversal of 104134210121 is 121012431401.
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 104134210121 - 26 = 104134210057 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104134210093 and 104134210102.
It is not an unprimeable number, because it can be changed into a prime (104134210111) 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, 3300995 + ... + 3332391.
It is an arithmetic number, because the mean of its divisors is an integer number (13067722008).
Almost surely, 2104134210121 is an apocalyptic number.
It is an amenable number.
104134210121 is a deficient number, since it is larger than the sum of its proper divisors (407565943).
104134210121 is a wasteful number, since it uses less digits than its factorization.
104134210121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44271.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 104134210121 its reverse (121012431401), we get a palindrome (225146641522).
The spelling of 104134210121 in words is "one hundred four billion, one hundred thirty-four million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •