Base | Representation |
---|---|
bin | 11101101100111010001… |
… | …00011010001001011101 |
3 | 10121120012100121212201010 |
4 | 32312131010122021131 |
5 | 113210032330141431 |
6 | 2100455234005433 |
7 | 133505664335634 |
oct | 16663504321135 |
9 | 3546170555633 |
10 | 1020542427741 |
11 | 36389a65aa01 |
12 | 145955716879 |
13 | 75310162125 |
14 | 375747aa51b |
15 | 1b82ee2b846 |
hex | ed9d11a25d |
1020542427741 has 8 divisors (see below), whose sum is σ = 1377947582080. Its totient is φ = 671749445952.
The previous prime is 1020542427731. The next prime is 1020542427743. The reversal of 1020542427741 is 1477242450201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1020542427741 - 213 = 1020542419549 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1020542427741.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020542427743) 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, 2153042860 + ... + 2153043333.
It is an arithmetic number, because the mean of its divisors is an integer number (172243447760).
Almost surely, 21020542427741 is an apocalyptic number.
It is an amenable number.
1020542427741 is a deficient number, since it is larger than the sum of its proper divisors (357405154339).
1020542427741 is an equidigital number, since it uses as much as digits as its factorization.
1020542427741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4306086275.
The product of its (nonzero) digits is 125440, while the sum is 39.
Adding to 1020542427741 its reverse (1477242450201), we get a palindrome (2497784877942).
The spelling of 1020542427741 in words is "one trillion, twenty billion, five hundred forty-two million, four hundred twenty-seven thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •