Base | Representation |
---|---|
bin | 1001010110000111101011… |
… | …00100011101110100100011 |
3 | 2200202200100111101211002010 |
4 | 10223003311210131310203 |
5 | 10143202421320140230 |
6 | 111413035543524003 |
7 | 4220530654444503 |
oct | 453036544356443 |
9 | 80680314354063 |
10 | 20551243521315 |
11 | 660380821a551 |
12 | 237ab75a59603 |
13 | b60c879c3250 |
14 | 510984dcda03 |
15 | 2598b95e49b0 |
hex | 12b0f591dd23 |
20551243521315 has 16 divisors (see below), whose sum is σ = 35411373452448. Its totient is φ = 10117535271936.
The previous prime is 20551243521251. The next prime is 20551243521331. The reversal of 20551243521315 is 51312534215502.
It is not a de Polignac number, because 20551243521315 - 26 = 20551243521251 is a prime.
It is a super-2 number, since 2×205512435213152 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 52695496014 + ... + 52695496403.
It is an arithmetic number, because the mean of its divisors is an integer number (2213210840778).
Almost surely, 220551243521315 is an apocalyptic number.
20551243521315 is a deficient number, since it is larger than the sum of its proper divisors (14860129931133).
20551243521315 is a wasteful number, since it uses less digits than its factorization.
20551243521315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105390992438.
The product of its (nonzero) digits is 180000, while the sum is 39.
Adding to 20551243521315 its reverse (51312534215502), we get a palindrome (71863777736817).
The spelling of 20551243521315 in words is "twenty trillion, five hundred fifty-one billion, two hundred forty-three million, five hundred twenty-one thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •