Base | Representation |
---|---|
bin | 1001001111000110100011… |
… | …01000110011100100001101 |
3 | 2122220121222100200100111001 |
4 | 10213203101220303210031 |
5 | 10130230112330314410 |
6 | 111110201431500301 |
7 | 4164233524615054 |
oct | 447432150634415 |
9 | 78817870610431 |
10 | 20310122510605 |
11 | 6520524745384 |
12 | 23402a2b27691 |
13 | b4430c2c5695 |
14 | 50302d8d339b |
15 | 2534a605233a |
hex | 1278d1a3390d |
20310122510605 has 8 divisors (see below), whose sum is σ = 24372886723992. Its totient is φ = 16247604867648.
The previous prime is 20310122510539. The next prime is 20310122510621. The reversal of 20310122510605 is 50601522101302.
It can be written as a sum of positive squares in 4 ways, for example, as 1543326682249 + 18766795828356 = 1242307^2 + 4332066^2 .
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 20310122510605 - 237 = 20172683557133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61461342 + ... + 61790911.
It is an arithmetic number, because the mean of its divisors is an integer number (3046610840499).
Almost surely, 220310122510605 is an apocalyptic number.
It is an amenable number.
20310122510605 is a deficient number, since it is larger than the sum of its proper divisors (4062764213387).
20310122510605 is a wasteful number, since it uses less digits than its factorization.
20310122510605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123285215.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 20310122510605 its reverse (50601522101302), we get a palindrome (70911644611907).
The spelling of 20310122510605 in words is "twenty trillion, three hundred ten billion, one hundred twenty-two million, five hundred ten thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •