Base | Representation |
---|---|
bin | 1001000110001110011010… |
… | …10001111000110111011001 |
3 | 2121211110200021122120012212 |
4 | 10203013031101320313121 |
5 | 10110230424304403441 |
6 | 110314115200444505 |
7 | 4133215123263032 |
oct | 443071521706731 |
9 | 77743607576185 |
10 | 20005106716121 |
11 | 641313323348a |
12 | 22b1159919735 |
13 | b21620298057 |
14 | 4d237657ba89 |
15 | 24a5a336beeb |
hex | 1231cd478dd9 |
20005106716121 has 32 divisors (see below), whose sum is σ = 21185478623232. Its totient is φ = 18853177337280.
The previous prime is 20005106716109. The next prime is 20005106716123. The reversal of 20005106716121 is 12161760150002.
It is not a de Polignac number, because 20005106716121 - 214 = 20005106699737 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20005106716123) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 250578416 + ... + 250658238.
It is an arithmetic number, because the mean of its divisors is an integer number (662046206976).
Almost surely, 220005106716121 is an apocalyptic number.
It is an amenable number.
20005106716121 is a deficient number, since it is larger than the sum of its proper divisors (1180371907111).
20005106716121 is a wasteful number, since it uses less digits than its factorization.
20005106716121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80573.
The product of its (nonzero) digits is 5040, while the sum is 32.
Adding to 20005106716121 its reverse (12161760150002), we get a palindrome (32166866866123).
The spelling of 20005106716121 in words is "twenty trillion, five billion, one hundred six million, seven hundred sixteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •