Base | Representation |
---|---|
bin | 1100011010010100001… |
… | …0101100010111000011 |
3 | 202101100211110100202201 |
4 | 3012211002230113003 |
5 | 11443134410003011 |
6 | 241541502454031 |
7 | 21255564010156 |
oct | 3064502542703 |
9 | 671324410681 |
10 | 213222344131 |
11 | 82477500035 |
12 | 353a7894317 |
13 | 1715079c544 |
14 | a46a1a7c9d |
15 | 582e195cc1 |
hex | 31a50ac5c3 |
213222344131 has 2 divisors, whose sum is σ = 213222344132. Its totient is φ = 213222344130.
The previous prime is 213222344129. The next prime is 213222344173. The reversal of 213222344131 is 131443222312.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 213222344131 - 21 = 213222344129 is a prime.
It is a super-2 number, since 2×2132223441312 (a number of 23 digits) contains 22 as substring.
Together with 213222344129, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 213222344131.
It is not a weakly prime, because it can be changed into another prime (213222341131) 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, 106611172065 + 106611172066.
It is an arithmetic number, because the mean of its divisors is an integer number (106611172066).
Almost surely, 2213222344131 is an apocalyptic number.
213222344131 is a deficient number, since it is larger than the sum of its proper divisors (1).
213222344131 is an equidigital number, since it uses as much as digits as its factorization.
213222344131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6912, while the sum is 28.
Adding to 213222344131 its reverse (131443222312), we get a palindrome (344665566443).
The spelling of 213222344131 in words is "two hundred thirteen billion, two hundred twenty-two million, three hundred forty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •