Base | Representation |
---|---|
bin | 1001001001000001001111… |
… | …01001000100010001100001 |
3 | 2122011122111001120102110122 |
4 | 10210200213221010101201 |
5 | 10113314034134201423 |
6 | 110430153503410025 |
7 | 4143154203024233 |
oct | 444404751042141 |
9 | 78148431512418 |
10 | 20101112022113 |
11 | 644a919779881 |
12 | 23078918b3915 |
13 | b2a6b02c3215 |
14 | 4d6c82c6a253 |
15 | 24cd21a2d8c8 |
hex | 124827a44461 |
20101112022113 has 2 divisors, whose sum is σ = 20101112022114. Its totient is φ = 20101112022112.
The previous prime is 20101112022077. The next prime is 20101112022139. The reversal of 20101112022113 is 31122021110102.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19514023531024 + 587088491089 = 4417468^2 + 766217^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20101112022113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20101112022091 and 20101112022100.
It is not a weakly prime, because it can be changed into another prime (20101117022113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050556011056 + 10050556011057.
It is an arithmetic number, because the mean of its divisors is an integer number (10050556011057).
Almost surely, 220101112022113 is an apocalyptic number.
It is an amenable number.
20101112022113 is a deficient number, since it is larger than the sum of its proper divisors (1).
20101112022113 is an equidigital number, since it uses as much as digits as its factorization.
20101112022113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 20101112022113 its reverse (31122021110102), we get a palindrome (51223133132215).
The spelling of 20101112022113 in words is "twenty trillion, one hundred one billion, one hundred twelve million, twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •