Base | Representation |
---|---|
bin | 1001001111000110111011… |
… | …10011001010000001001001 |
3 | 2122220122111120121122201221 |
4 | 10213203131303022001021 |
5 | 10130231022044104401 |
6 | 111110234001042041 |
7 | 4164241553126623 |
oct | 447433563120111 |
9 | 78818446548657 |
10 | 20310326550601 |
11 | 652061993767a |
12 | 234033b326321 |
13 | b443426657c9 |
14 | 50304ca47c13 |
15 | 2534b8e087a1 |
hex | 1278ddcca049 |
20310326550601 has 8 divisors (see below), whose sum is σ = 20319300296064. Its totient is φ = 20301353360400.
The previous prime is 20310326550583. The next prime is 20310326550617. The reversal of 20310326550601 is 10605562301302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20310326550601 - 219 = 20310326026313 is a prime.
It is a super-2 number, since 2×203103265506012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20310326551601) 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, 84259551 + ... + 84500251.
It is an arithmetic number, because the mean of its divisors is an integer number (2539912537008).
Almost surely, 220310326550601 is an apocalyptic number.
It is an amenable number.
20310326550601 is a deficient number, since it is larger than the sum of its proper divisors (8973745463).
20310326550601 is a wasteful number, since it uses less digits than its factorization.
20310326550601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277631.
The product of its (nonzero) digits is 32400, while the sum is 34.
Adding to 20310326550601 its reverse (10605562301302), we get a palindrome (30915888851903).
The spelling of 20310326550601 in words is "twenty trillion, three hundred ten billion, three hundred twenty-six million, five hundred fifty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •