Base | Representation |
---|---|
bin | 10010101100110100010001… |
… | …10111011010100100010110 |
3 | 12101121020212201001201102220 |
4 | 21112122020313122210112 |
5 | 20342221444124320042 |
6 | 223243155125243210 |
7 | 11442663153132231 |
oct | 1126321067324426 |
9 | 171536781051386 |
10 | 41122313120022 |
11 | 12114969777422 |
12 | 4741943563506 |
13 | 19c3a82037524 |
14 | a2248b150418 |
15 | 4b4a4454c8ec |
hex | 256688dda916 |
41122313120022 has 16 divisors (see below), whose sum is σ = 82456052019120. Its totient is φ = 13672200076832.
The previous prime is 41122313120011. The next prime is 41122313120023. The reversal of 41122313120022 is 22002131322114.
It is a super-2 number, since 2×411223131200222 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 41122313119974 and 41122313120001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41122313120023) 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, 8809404933 + ... + 8809409600.
It is an arithmetic number, because the mean of its divisors is an integer number (5153503251195).
Almost surely, 241122313120022 is an apocalyptic number.
41122313120022 is an abundant number, since it is smaller than the sum of its proper divisors (41333738899098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41122313120022 is a wasteful number, since it uses less digits than its factorization.
41122313120022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17618814927.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 41122313120022 its reverse (22002131322114), we get a palindrome (63124444442136).
The spelling of 41122313120022 in words is "forty-one trillion, one hundred twenty-two billion, three hundred thirteen million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •