Base | Representation |
---|---|
bin | 1100111111001000001… |
… | …0010001001101001101 |
3 | 210022212111120011021112 |
4 | 3033302002101031031 |
5 | 12123404111410013 |
6 | 250254221141405 |
7 | 22055503551611 |
oct | 3176202211515 |
9 | 708774504245 |
10 | 223104013133 |
11 | 86688443231 |
12 | 372a50ba865 |
13 | 18066ac8671 |
14 | ab26727341 |
15 | 5c0b97cba8 |
hex | 33f209134d |
223104013133 has 2 divisors, whose sum is σ = 223104013134. Its totient is φ = 223104013132.
The previous prime is 223104013087. The next prime is 223104013147. The reversal of 223104013133 is 331310401322.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 195998342089 + 27105671044 = 442717^2 + 164638^2 .
It is a cyclic number.
It is not a de Polignac number, because 223104013133 - 226 = 223036904269 is a prime.
It is a super-3 number, since 3×2231040131333 (a number of 35 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 223104013099 and 223104013108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (223104013163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111552006566 + 111552006567.
It is an arithmetic number, because the mean of its divisors is an integer number (111552006567).
Almost surely, 2223104013133 is an apocalyptic number.
It is an amenable number.
223104013133 is a deficient number, since it is larger than the sum of its proper divisors (1).
223104013133 is an equidigital number, since it uses as much as digits as its factorization.
223104013133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 223104013133 its reverse (331310401322), we get a palindrome (554414414455).
The spelling of 223104013133 in words is "two hundred twenty-three billion, one hundred four million, thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •