Base | Representation |
---|---|
bin | 110000100000001111101101… |
… | …010100010011001100100011 |
3 | 1000222022101200110220102121001 |
4 | 300200033231110103030203 |
5 | 210430032201241242011 |
6 | 2033410455143012431 |
7 | 62635005023604052 |
oct | 6040175524231443 |
9 | 1028271613812531 |
10 | 213322122212131 |
11 | 61a75449768789 |
12 | 1bb1330b13a117 |
13 | 920526101793a |
14 | 3a96bbac62399 |
15 | 199dee81047c1 |
hex | c203ed513323 |
213322122212131 has 2 divisors, whose sum is σ = 213322122212132. Its totient is φ = 213322122212130.
The previous prime is 213322122212053. The next prime is 213322122212149. The reversal of 213322122212131 is 131212221223312.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 213322122212131 - 241 = 211123098956579 is a prime.
It is a super-2 number, since 2×2133221222121312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 213322122212131.
It is not a weakly prime, because it can be changed into another prime (213322122212161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106661061106065 + 106661061106066.
It is an arithmetic number, because the mean of its divisors is an integer number (106661061106066).
Almost surely, 2213322122212131 is an apocalyptic number.
213322122212131 is a deficient number, since it is larger than the sum of its proper divisors (1).
213322122212131 is an equidigital number, since it uses as much as digits as its factorization.
213322122212131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3456, while the sum is 28.
Adding to 213322122212131 its reverse (131212221223312), we get a palindrome (344534343435443).
The spelling of 213322122212131 in words is "two hundred thirteen trillion, three hundred twenty-two billion, one hundred twenty-two million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •