Base | Representation |
---|---|
bin | 110010000100011110110110… |
… | …000101000011001010110111 |
3 | 1001212200220100000221111120211 |
4 | 302010132312011003022313 |
5 | 212330411220142311411 |
6 | 2100203120435410251 |
7 | 64245446042412241 |
oct | 6204366605031267 |
9 | 1055626300844524 |
10 | 220210323010231 |
11 | 641907455169a4 |
12 | 2084629b753987 |
13 | 95b498a475658 |
14 | 3c54344d69091 |
15 | 1a6d2987ae221 |
hex | c847b61432b7 |
220210323010231 has 2 divisors, whose sum is σ = 220210323010232. Its totient is φ = 220210323010230.
The previous prime is 220210323010219. The next prime is 220210323010261. The reversal of 220210323010231 is 132010323012022.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 220210323010231 - 235 = 220175963271863 is a prime.
It is a super-2 number, since 2×2202103230102312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220210323010261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110105161505115 + 110105161505116.
It is an arithmetic number, because the mean of its divisors is an integer number (110105161505116).
Almost surely, 2220210323010231 is an apocalyptic number.
220210323010231 is a deficient number, since it is larger than the sum of its proper divisors (1).
220210323010231 is an equidigital number, since it uses as much as digits as its factorization.
220210323010231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 220210323010231 its reverse (132010323012022), we get a palindrome (352220646022253).
The spelling of 220210323010231 in words is "two hundred twenty trillion, two hundred ten billion, three hundred twenty-three million, ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •