Base | Representation |
---|---|
bin | 1001010100111101010110… |
… | …11001000011011011110101 |
3 | 2200121212100211222212200002 |
4 | 10222132223121003123311 |
5 | 10142024213120410010 |
6 | 111342440445201045 |
7 | 4214616142652333 |
oct | 452365331033365 |
9 | 80555324885602 |
10 | 20511344310005 |
11 | 65988a315154a |
12 | 237329b860185 |
13 | b5a29979c483 |
14 | 50ca7bd7ab53 |
15 | 2588318bb1a5 |
hex | 12a7ab6436f5 |
20511344310005 has 16 divisors (see below), whose sum is σ = 24627132295920. Its totient is φ = 16400063626752.
The previous prime is 20511344309969. The next prime is 20511344310043. The reversal of 20511344310005 is 50001344311502.
It can be written as a sum of positive squares in 8 ways, for example, as 1955986856356 + 18555357453649 = 1398566^2 + 4307593^2 .
It is a cyclic number.
It is not a de Polignac number, because 20511344310005 - 210 = 20511344308981 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20511344310005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 222910667 + ... + 223002663.
It is an arithmetic number, because the mean of its divisors is an integer number (1539195768495).
Almost surely, 220511344310005 is an apocalyptic number.
It is an amenable number.
20511344310005 is a deficient number, since it is larger than the sum of its proper divisors (4115787985915).
20511344310005 is a wasteful number, since it uses less digits than its factorization.
20511344310005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116008.
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 20511344310005 its reverse (50001344311502), we get a palindrome (70512688621507).
The spelling of 20511344310005 in words is "twenty trillion, five hundred eleven billion, three hundred forty-four million, three hundred ten thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.388 sec. • engine limits •