Base | Representation |
---|---|
bin | 10010101101001010110100… |
… | …11111111101100111110101 |
3 | 12101122102010110112011001022 |
4 | 21112211122133331213311 |
5 | 20342421243022401401 |
6 | 223252520340310525 |
7 | 11443602164013335 |
oct | 1126453237754765 |
9 | 171572113464038 |
10 | 41134420122101 |
11 | 1211a011872269 |
12 | 47441620a2445 |
13 | 19c4c613c4997 |
14 | a22cb90630c5 |
15 | 4b50023a771b |
hex | 25695a7fd9f5 |
41134420122101 has 16 divisors (see below), whose sum is σ = 42957250269696. Its totient is φ = 39314461510896.
The previous prime is 41134420122067. The next prime is 41134420122179. The reversal of 41134420122101 is 10122102443114.
It is a cyclic number.
It is not a de Polignac number, because 41134420122101 - 214 = 41134420105717 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41134425122101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 285181466 + ... + 285325668.
It is an arithmetic number, because the mean of its divisors is an integer number (2684828141856).
Almost surely, 241134420122101 is an apocalyptic number.
It is an amenable number.
41134420122101 is a deficient number, since it is larger than the sum of its proper divisors (1822830147595).
41134420122101 is a wasteful number, since it uses less digits than its factorization.
41134420122101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154072.
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 41134420122101 its reverse (10122102443114), we get a palindrome (51256522565215).
The spelling of 41134420122101 in words is "forty-one trillion, one hundred thirty-four billion, four hundred twenty million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •