Base | Representation |
---|---|
bin | 11101110101001111100101… |
… | …110110010001100111011111 |
3 | 122012112210212110011220212112 |
4 | 131311033211312101213133 |
5 | 114144104122340420221 |
6 | 1143013245132024235 |
7 | 36431022242621522 |
oct | 3565174566214737 |
9 | 565483773156775 |
10 | 131202222201311 |
11 | 38894605aa8028 |
12 | 1286ba5290207b |
13 | 58294163758c1 |
14 | 24583158a2bb9 |
15 | 1027d0e3d915b |
hex | 7753e5d919df |
131202222201311 has 16 divisors (see below), whose sum is σ = 133314891939840. Its totient is φ = 129105996927840.
The previous prime is 131202222201221. The next prime is 131202222201329. The reversal of 131202222201311 is 113102222202131.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131202222201311 is a prime.
It is a super-2 number, since 2×1312022222013112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131202222204311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 85179581 + ... + 86706201.
It is an arithmetic number, because the mean of its divisors is an integer number (8332180746240).
Almost surely, 2131202222201311 is an apocalyptic number.
131202222201311 is a deficient number, since it is larger than the sum of its proper divisors (2112669738529).
131202222201311 is a wasteful number, since it uses less digits than its factorization.
131202222201311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1532006.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 131202222201311 its reverse (113102222202131), we get a palindrome (244304444403442).
The spelling of 131202222201311 in words is "one hundred thirty-one trillion, two hundred two billion, two hundred twenty-two million, two hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •