Base | Representation |
---|---|
bin | 1001001001011110011000… |
… | …11011100100011000010011 |
3 | 2122020010212201001200100021 |
4 | 10210233030123210120103 |
5 | 10114043111434014011 |
6 | 110441302425004311 |
7 | 4144250051331022 |
oct | 444571433443023 |
9 | 78203781050307 |
10 | 20116761626131 |
11 | 645651a549a15 |
12 | 230a91a923697 |
13 | b2c0055b4c41 |
14 | 4d792946a8b9 |
15 | 24d43a8ad471 |
hex | 124bcc6e4613 |
20116761626131 has 2 divisors, whose sum is σ = 20116761626132. Its totient is φ = 20116761626130.
The previous prime is 20116761626119. The next prime is 20116761626153. The reversal of 20116761626131 is 13162616761102.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20116761626131 is a prime.
It is a super-2 number, since 2×201167616261312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20116761626191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10058380813065 + 10058380813066.
It is an arithmetic number, because the mean of its divisors is an integer number (10058380813066).
Almost surely, 220116761626131 is an apocalyptic number.
20116761626131 is a deficient number, since it is larger than the sum of its proper divisors (1).
20116761626131 is an equidigital number, since it uses as much as digits as its factorization.
20116761626131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108864, while the sum is 43.
The spelling of 20116761626131 in words is "twenty trillion, one hundred sixteen billion, seven hundred sixty-one million, six hundred twenty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •