Base | Representation |
---|---|
bin | 10111101100010101001000… |
… | …000111010001011010001001 |
3 | 111122221120001112011012100002 |
4 | 113230111020013101122021 |
5 | 102124213442311342441 |
6 | 1005341244554452345 |
7 | 30643206054116561 |
oct | 2754251007213211 |
9 | 448846045135302 |
10 | 104201411434121 |
11 | 30224630258321 |
12 | b82ab21a340b5 |
13 | 461b1c67b3861 |
14 | 1ba353787dda1 |
15 | c0a7b7aa1b9b |
hex | 5ec5481d1689 |
104201411434121 has 8 divisors (see below), whose sum is σ = 104550889102464. Its totient is φ = 103852039281120.
The previous prime is 104201411434079. The next prime is 104201411434171. The reversal of 104201411434121 is 121434114102401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104201411434121 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (104201411434171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24400181 + ... + 28350866.
It is an arithmetic number, because the mean of its divisors is an integer number (13068861137808).
Almost surely, 2104201411434121 is an apocalyptic number.
It is an amenable number.
104201411434121 is a deficient number, since it is larger than the sum of its proper divisors (349477668343).
104201411434121 is an equidigital number, since it uses as much as digits as its factorization.
104201411434121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52757671.
The product of its (nonzero) digits is 3072, while the sum is 29.
Adding to 104201411434121 its reverse (121434114102401), we get a palindrome (225635525536522).
The spelling of 104201411434121 in words is "one hundred four trillion, two hundred one billion, four hundred eleven million, four hundred thirty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •