Base | Representation |
---|---|
bin | 11010101000011… |
… | …11111101110001 |
3 | 120120101111202112 |
4 | 31110033331301 |
5 | 424143141311 |
6 | 34100255105 |
7 | 5351654114 |
oct | 1524177561 |
9 | 516344675 |
10 | 223412081 |
11 | 105123892 |
12 | 629a1495 |
13 | 373937c9 |
14 | 2195857b |
15 | 1493128b |
hex | d50ff71 |
223412081 has 2 divisors, whose sum is σ = 223412082. Its totient is φ = 223412080.
The previous prime is 223412053. The next prime is 223412083. The reversal of 223412081 is 180214322.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 193655056 + 29757025 = 13916^2 + 5455^2 .
It is a cyclic number.
It is not a de Polignac number, because 223412081 - 222 = 219217777 is a prime.
It is a super-2 number, since 2×2234120812 = 99825915873501122, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 223412083, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (223412083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111706040 + 111706041.
It is an arithmetic number, because the mean of its divisors is an integer number (111706041).
Almost surely, 2223412081 is an apocalyptic number.
It is an amenable number.
223412081 is a deficient number, since it is larger than the sum of its proper divisors (1).
223412081 is an equidigital number, since it uses as much as digits as its factorization.
223412081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 23.
The square root of 223412081 is about 14946.9756472672. The cubic root of 223412081 is about 606.7859989799.
The spelling of 223412081 in words is "two hundred twenty-three million, four hundred twelve thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •