Base | Representation |
---|---|
bin | 1100011010010011111… |
… | …0110000001110000001 |
3 | 202101100202111220001222 |
4 | 3012210332300032001 |
5 | 11443134123430421 |
6 | 241541424404425 |
7 | 21255552146162 |
oct | 3064476601601 |
9 | 671322456058 |
10 | 213221311361 |
11 | 82476965103 |
12 | 353a7476715 |
13 | 171504ca436 |
14 | a469db9769 |
15 | 582e03ecab |
hex | 31a4fb0381 |
213221311361 has 2 divisors, whose sum is σ = 213221311362. Its totient is φ = 213221311360.
The previous prime is 213221311351. The next prime is 213221311441. The reversal of 213221311361 is 163113122312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 191357253136 + 21864058225 = 437444^2 + 147865^2 .
It is a cyclic number.
It is not a de Polignac number, because 213221311361 - 26 = 213221311297 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 213221311361.
It is not a weakly prime, because it can be changed into another prime (213221311351) 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, 106610655680 + 106610655681.
It is an arithmetic number, because the mean of its divisors is an integer number (106610655681).
Almost surely, 2213221311361 is an apocalyptic number.
It is an amenable number.
213221311361 is a deficient number, since it is larger than the sum of its proper divisors (1).
213221311361 is an equidigital number, since it uses as much as digits as its factorization.
213221311361 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1296, while the sum is 26.
Adding to 213221311361 its reverse (163113122312), we get a palindrome (376334433673).
The spelling of 213221311361 in words is "two hundred thirteen billion, two hundred twenty-one million, three hundred eleven thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •