Base | Representation |
---|---|
bin | 101101100001101000010011… |
… | …100010001011000000101111 |
3 | 222020221010212000100101212211 |
4 | 231201220103202023000233 |
5 | 202220423413430130111 |
6 | 1545501121154111251 |
7 | 60113433252530335 |
oct | 5541502342130057 |
9 | 866833760311784 |
10 | 200223113130031 |
11 | 58885166613202 |
12 | 1a5586b757b527 |
13 | 8794c5cc2a154 |
14 | 3762bc9641b55 |
15 | 18233e171d521 |
hex | b61a1388b02f |
200223113130031 has 2 divisors, whose sum is σ = 200223113130032. Its totient is φ = 200223113130030.
The previous prime is 200223113129999. The next prime is 200223113130041. The reversal of 200223113130031 is 130031311322002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200223113130031 - 25 = 200223113129999 is a prime.
It is a super-2 number, since 2×2002231131300312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200223113129984 and 200223113130011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200223113130041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100111556565015 + 100111556565016.
It is an arithmetic number, because the mean of its divisors is an integer number (100111556565016).
Almost surely, 2200223113130031 is an apocalyptic number.
200223113130031 is a deficient number, since it is larger than the sum of its proper divisors (1).
200223113130031 is an equidigital number, since it uses as much as digits as its factorization.
200223113130031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 200223113130031 its reverse (130031311322002), we get a palindrome (330254424452033).
The spelling of 200223113130031 in words is "two hundred trillion, two hundred twenty-three billion, one hundred thirteen million, one hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •