Base | Representation |
---|---|
bin | 10011010011010001001101… |
… | …01101000011000000000111 |
3 | 12120021120010121200022100010 |
4 | 21221220212231003000013 |
5 | 21030343310114141210 |
6 | 230134140535521303 |
7 | 11640304616525661 |
oct | 1151504655030007 |
9 | 176246117608303 |
10 | 42443516162055 |
11 | 12584215411948 |
12 | 4915a07829233 |
13 | 1a8b538b27588 |
14 | a6a3c46a3531 |
15 | 4d90beb2a920 |
hex | 269a26b43007 |
42443516162055 has 16 divisors (see below), whose sum is σ = 68265173643264. Its totient is φ = 22518026025120.
The previous prime is 42443516162051. The next prime is 42443516162063. The reversal of 42443516162055 is 55026161534424.
It is not a de Polignac number, because 42443516162055 - 22 = 42443516162051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42443516161995 and 42443516162013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42443516162051) by changing a digit.
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 in 15 ways as a sum of consecutive naturals, for example, 7407242539 + ... + 7407248268.
It is an arithmetic number, because the mean of its divisors is an integer number (4266573352704).
Almost surely, 242443516162055 is an apocalyptic number.
42443516162055 is a deficient number, since it is larger than the sum of its proper divisors (25821657481209).
42443516162055 is a wasteful number, since it uses less digits than its factorization.
42443516162055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14814491006.
The product of its (nonzero) digits is 3456000, while the sum is 48.
Adding to 42443516162055 its reverse (55026161534424), we get a palindrome (97469677696479).
The spelling of 42443516162055 in words is "forty-two trillion, four hundred forty-three billion, five hundred sixteen million, one hundred sixty-two thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •