Base | Representation |
---|---|
bin | 1001000110000101111010… |
… | …01110011010110011000001 |
3 | 2121211000220012002110202112 |
4 | 10203002331032122303001 |
5 | 10110142102323410102 |
6 | 110312042231425105 |
7 | 4132664041254665 |
oct | 443027516326301 |
9 | 77730805073675 |
10 | 20000542403777 |
11 | 6411200857021 |
12 | 22b02a5225195 |
13 | b21073794810 |
14 | 4d20622d08a5 |
15 | 24a3d77c8252 |
hex | 1230bd39acc1 |
20000542403777 has 4 divisors (see below), whose sum is σ = 21539045665620. Its totient is φ = 18462039141936.
The previous prime is 20000542403719. The next prime is 20000542403783. The reversal of 20000542403777 is 77730424500002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2556813792016 + 17443728611761 = 1599004^2 + 4176569^2 .
It is not a de Polignac number, because 20000542403777 - 26 = 20000542403713 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20000542403477) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 769251630902 + ... + 769251630927.
It is an arithmetic number, because the mean of its divisors is an integer number (5384761416405).
Almost surely, 220000542403777 is an apocalyptic number.
It is an amenable number.
20000542403777 is a deficient number, since it is larger than the sum of its proper divisors (1538503261843).
20000542403777 is a wasteful number, since it uses less digits than its factorization.
20000542403777 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1538503261842.
The product of its (nonzero) digits is 329280, while the sum is 41.
Adding to 20000542403777 its reverse (77730424500002), we get a palindrome (97730966903779).
The spelling of 20000542403777 in words is "twenty trillion, five hundred forty-two million, four hundred three thousand, seven hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •