Base | Representation |
---|---|
bin | 1100011010101001010… |
… | …1101110110110001101 |
3 | 202101121000200210002112 |
4 | 3012222111232312031 |
5 | 11443330133034013 |
6 | 241554355433405 |
7 | 21261023314613 |
oct | 3065225566615 |
9 | 671530623075 |
10 | 213311221133 |
11 | 825126946aa |
12 | 354115b5865 |
13 | 1716601a29a |
14 | a477d016b3 |
15 | 5836d9eba8 |
hex | 31aa56ed8d |
213311221133 has 2 divisors, whose sum is σ = 213311221134. Its totient is φ = 213311221132.
The previous prime is 213311221051. The next prime is 213311221141. The reversal of 213311221133 is 331122113312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 207605987044 + 5705234089 = 455638^2 + 75533^2 .
It is a cyclic number.
It is not a de Polignac number, because 213311221133 - 28 = 213311220877 is a prime.
It is a super-2 number, since 2×2133112211332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 213311221099 and 213311221108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213311229133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106655610566 + 106655610567.
It is an arithmetic number, because the mean of its divisors is an integer number (106655610567).
Almost surely, 2213311221133 is an apocalyptic number.
It is an amenable number.
213311221133 is a deficient number, since it is larger than the sum of its proper divisors (1).
213311221133 is an equidigital number, since it uses as much as digits as its factorization.
213311221133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 648, while the sum is 23.
Adding to 213311221133 its reverse (331122113312), we get a palindrome (544433334445).
The spelling of 213311221133 in words is "two hundred thirteen billion, three hundred eleven million, two hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •