Base | Representation |
---|---|
bin | 1001001001000001100111… |
… | …00001010101110001000001 |
3 | 2122011122222221120222011102 |
4 | 10210200303201111301001 |
5 | 10113314441144320301 |
6 | 110430225343224145 |
7 | 4143162143041043 |
oct | 444406341256101 |
9 | 78148887528142 |
10 | 20101311323201 |
11 | 644aa11224719 |
12 | 23079285a8055 |
13 | b2a712694364 |
14 | 4d6ca1509a93 |
15 | 24cd3429ab6b |
hex | 124833855c41 |
20101311323201 has 2 divisors, whose sum is σ = 20101311323202. Its totient is φ = 20101311323200.
The previous prime is 20101311323117. The next prime is 20101311323237. The reversal of 20101311323201 is 10232311310102.
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., 19810056820801 + 291254502400 = 4450849^2 + 539680^2 .
It is a cyclic number.
It is not a de Polignac number, because 20101311323201 - 234 = 20084131454017 is a prime.
It is not a weakly prime, because it can be changed into another prime (20101311328201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050655661600 + 10050655661601.
It is an arithmetic number, because the mean of its divisors is an integer number (10050655661601).
Almost surely, 220101311323201 is an apocalyptic number.
It is an amenable number.
20101311323201 is a deficient number, since it is larger than the sum of its proper divisors (1).
20101311323201 is an equidigital number, since it uses as much as digits as its factorization.
20101311323201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 20101311323201 its reverse (10232311310102), we get a palindrome (30333622633303).
The spelling of 20101311323201 in words is "twenty trillion, one hundred one billion, three hundred eleven million, three hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •