Base | Representation |
---|---|
bin | 1001000111000001010001… |
… | …10001011101000001110110 |
3 | 2121221002011012110101010201 |
4 | 10203200220301131001312 |
5 | 10111202334322134032 |
6 | 110334432433311114 |
7 | 4135202555300416 |
oct | 443405061350166 |
9 | 77832135411121 |
10 | 20032411521142 |
11 | 6423775072649 |
12 | 22b64ba10549a |
13 | b24082169807 |
14 | 4d3806a84646 |
15 | 24b15055e8e7 |
hex | 123828c5d076 |
20032411521142 has 4 divisors (see below), whose sum is σ = 30048617281716. Its totient is φ = 10016205760570.
The previous prime is 20032411521137. The next prime is 20032411521173. The reversal of 20032411521142 is 24112511423002.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×200324115211422 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20032411521142.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 5008102880284 + ... + 5008102880287.
It is an arithmetic number, because the mean of its divisors is an integer number (7512154320429).
Almost surely, 220032411521142 is an apocalyptic number.
20032411521142 is a deficient number, since it is larger than the sum of its proper divisors (10016205760574).
20032411521142 is a wasteful number, since it uses less digits than its factorization.
20032411521142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10016205760573.
The product of its (nonzero) digits is 3840, while the sum is 28.
Adding to 20032411521142 its reverse (24112511423002), we get a palindrome (44144922944144).
The spelling of 20032411521142 in words is "twenty trillion, thirty-two billion, four hundred eleven million, five hundred twenty-one thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •