Base | Representation |
---|---|
bin | 1100000000111111001110… |
… | …1101110110111000101101 |
3 | 1201202222012012110100210122 |
4 | 3000033303231312320231 |
5 | 3212422330002214411 |
6 | 44033033543414325 |
7 | 2532320463251243 |
oct | 300176355667055 |
9 | 51688165410718 |
10 | 13211113319981 |
11 | 4233890068765 |
12 | 159449b1543a5 |
13 | 74aa5852a475 |
14 | 3395c8074793 |
15 | 17d9b85d19db |
hex | c03f3b76e2d |
13211113319981 has 2 divisors, whose sum is σ = 13211113319982. Its totient is φ = 13211113319980.
The previous prime is 13211113319953. The next prime is 13211113320029. The reversal of 13211113319981 is 18991331111231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13119673607881 + 91439712100 = 3622109^2 + 302390^2 .
It is an emirp because it is prime and its reverse (18991331111231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13211113319981 - 218 = 13211113057837 is a prime.
It is a super-2 number, since 2×132111133199812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13211113319951) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6605556659990 + 6605556659991.
It is an arithmetic number, because the mean of its divisors is an integer number (6605556659991).
Almost surely, 213211113319981 is an apocalyptic number.
It is an amenable number.
13211113319981 is a deficient number, since it is larger than the sum of its proper divisors (1).
13211113319981 is an equidigital number, since it uses as much as digits as its factorization.
13211113319981 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 34992, while the sum is 44.
The spelling of 13211113319981 in words is "thirteen trillion, two hundred eleven billion, one hundred thirteen million, three hundred nineteen thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •