Base | Representation |
---|---|
bin | 1100111111010001000… |
… | …0101010011110111001 |
3 | 210022222002210121122022 |
4 | 3033310100222132321 |
5 | 12123443140403423 |
6 | 250302033204225 |
7 | 22056436050545 |
oct | 3176420523671 |
9 | 708862717568 |
10 | 223141341113 |
11 | 866a75192a9 |
12 | 372b5700675 |
13 | 18071767c22 |
14 | ab2b682a25 |
15 | 5c0eda2dc8 |
hex | 33f442a7b9 |
223141341113 has 2 divisors, whose sum is σ = 223141341114. Its totient is φ = 223141341112.
The previous prime is 223141340977. The next prime is 223141341127. The reversal of 223141341113 is 311143141322.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 134240166544 + 88901174569 = 366388^2 + 298163^2 .
It is a cyclic number.
It is not a de Polignac number, because 223141341113 - 28 = 223141340857 is a prime.
It is a super-3 number, since 3×2231413411133 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (223141341713) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111570670556 + 111570670557.
It is an arithmetic number, because the mean of its divisors is an integer number (111570670557).
Almost surely, 2223141341113 is an apocalyptic number.
It is an amenable number.
223141341113 is a deficient number, since it is larger than the sum of its proper divisors (1).
223141341113 is an equidigital number, since it uses as much as digits as its factorization.
223141341113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1728, while the sum is 26.
Adding to 223141341113 its reverse (311143141322), we get a palindrome (534284482435).
The spelling of 223141341113 in words is "two hundred twenty-three billion, one hundred forty-one million, three hundred forty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •