Base | Representation |
---|---|
bin | 110010101101100001111001… |
… | …101100000001110000000011 |
3 | 1002020200120021001202210002202 |
4 | 302231201321230001300003 |
5 | 213213120144423100311 |
6 | 2110203024023303415 |
7 | 64656315440502011 |
oct | 6255417154016003 |
9 | 1066616231683082 |
10 | 223031103331331 |
11 | 65078a61470269 |
12 | 21020b092aab6b |
13 | 975a986c13979 |
14 | 3d10a9794b8b1 |
15 | 1abb83e085e3b |
hex | cad879b01c03 |
223031103331331 has 2 divisors, whose sum is σ = 223031103331332. Its totient is φ = 223031103331330.
The previous prime is 223031103331213. The next prime is 223031103331397. The reversal of 223031103331331 is 133133301130322.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-223031103331331 is a prime.
It is a super-2 number, since 2×2230311033313312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 223031103331294 and 223031103331303.
It is not a weakly prime, because it can be changed into another prime (223031103361331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111515551665665 + 111515551665666.
It is an arithmetic number, because the mean of its divisors is an integer number (111515551665666).
Almost surely, 2223031103331331 is an apocalyptic number.
223031103331331 is a deficient number, since it is larger than the sum of its proper divisors (1).
223031103331331 is an equidigital number, since it uses as much as digits as its factorization.
223031103331331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8748, while the sum is 29.
Adding to 223031103331331 its reverse (133133301130322), we get a palindrome (356164404461653).
The spelling of 223031103331331 in words is "two hundred twenty-three trillion, thirty-one billion, one hundred three million, three hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •