Base | Representation |
---|---|
bin | 101101100001011100000111… |
… | …001000101100010100010111 |
3 | 222020212220001112201202212201 |
4 | 231201130013020230110113 |
5 | 202220220110134102411 |
6 | 1545451114043425331 |
7 | 60112460640616435 |
oct | 5541340710542427 |
9 | 866786045652781 |
10 | 200210020222231 |
11 | 5887a657a50848 |
12 | 1a556062825247 |
13 | 8793954528b26 |
14 | 376230680dd55 |
15 | 1822dc70683c1 |
hex | b6170722c517 |
200210020222231 has 2 divisors, whose sum is σ = 200210020222232. Its totient is φ = 200210020222230.
The previous prime is 200210020222189. The next prime is 200210020222307. The reversal of 200210020222231 is 132222020012002.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200210020222231 is a prime.
It is a super-2 number, since 2×2002100202222312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200210020222199 and 200210020222208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200210030222231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105010111115 + 100105010111116.
It is an arithmetic number, because the mean of its divisors is an integer number (100105010111116).
Almost surely, 2200210020222231 is an apocalyptic number.
200210020222231 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210020222231 is an equidigital number, since it uses as much as digits as its factorization.
200210020222231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 200210020222231 its reverse (132222020012002), we get a palindrome (332432040234233).
The spelling of 200210020222231 in words is "two hundred trillion, two hundred ten billion, twenty million, two hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •