Base | Representation |
---|---|
bin | 1100111111100100010… |
… | …0010110110111110101 |
3 | 210100011201120120101202 |
4 | 3033321010112313311 |
5 | 12124124313014031 |
6 | 250314034102245 |
7 | 22061435463146 |
oct | 3177104266765 |
9 | 710151516352 |
10 | 223222001141 |
11 | 86739000387 |
12 | 3731871a985 |
13 | 18085399859 |
14 | ab3827bacd |
15 | 5c16ed72cb |
hex | 33f9116df5 |
223222001141 has 2 divisors, whose sum is σ = 223222001142. Its totient is φ = 223222001140.
The previous prime is 223222001111. The next prime is 223222001243. The reversal of 223222001141 is 141100222322.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 200304582916 + 22917418225 = 447554^2 + 151385^2 .
It is a cyclic number.
It is not a de Polignac number, because 223222001141 - 26 = 223222001077 is a prime.
It is a super-3 number, since 3×2232220011413 (a number of 35 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (223222001111) 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, 111611000570 + 111611000571.
It is an arithmetic number, because the mean of its divisors is an integer number (111611000571).
Almost surely, 2223222001141 is an apocalyptic number.
It is an amenable number.
223222001141 is a deficient number, since it is larger than the sum of its proper divisors (1).
223222001141 is an equidigital number, since it uses as much as digits as its factorization.
223222001141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 223222001141 its reverse (141100222322), we get a palindrome (364322223463).
The spelling of 223222001141 in words is "two hundred twenty-three billion, two hundred twenty-two million, one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •