Base | Representation |
---|---|
bin | 11101101110000011111… |
… | …001000010101100011101 |
3 | 21020020120221121002211110 |
4 | 131232003321002230131 |
5 | 231430133442443031 |
6 | 4202121353212233 |
7 | 300360435362550 |
oct | 35560371025435 |
9 | 7206527532743 |
10 | 2042322234141 |
11 | 7181647267a2 |
12 | 28b995701079 |
13 | 11a789775077 |
14 | 70bc5636697 |
15 | 381d37c8c46 |
hex | 1db83e42b1d |
2042322234141 has 32 divisors (see below), whose sum is σ = 3165030236160. Its totient is φ = 1147323026304.
The previous prime is 2042322234077. The next prime is 2042322234151. The reversal of 2042322234141 is 1414322232402.
It is not a de Polignac number, because 2042322234141 - 26 = 2042322234077 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2042322234099 and 2042322234108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2042322234151) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2255205 + ... + 3028298.
It is an arithmetic number, because the mean of its divisors is an integer number (98907194880).
Almost surely, 22042322234141 is an apocalyptic number.
2042322234141 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2042322234141 is a deficient number, since it is larger than the sum of its proper divisors (1122708002019).
2042322234141 is a wasteful number, since it uses less digits than its factorization.
2042322234141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5283825.
The product of its (nonzero) digits is 18432, while the sum is 30.
Adding to 2042322234141 its reverse (1414322232402), we get a palindrome (3456644466543).
The spelling of 2042322234141 in words is "two trillion, forty-two billion, three hundred twenty-two million, two hundred thirty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •