Base | Representation |
---|---|
bin | 101010001010… |
… | …0100110001101 |
3 | 1112121000121202 |
4 | 1110110212031 |
5 | 21124320321 |
6 | 2105435245 |
7 | 355612331 |
oct | 124244615 |
9 | 45530552 |
10 | 22104461 |
11 | 11528455 |
12 | 749bb25 |
13 | 476c282 |
14 | 2d157c1 |
15 | 1e1970b |
hex | 151498d |
22104461 has 2 divisors, whose sum is σ = 22104462. Its totient is φ = 22104460.
The previous prime is 22104431. The next prime is 22104463. The reversal of 22104461 is 16440122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21949225 + 155236 = 4685^2 + 394^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22104461 is a prime.
It is a super-2 number, since 2×221044612 = 977214392201042, which contains 22 as substring.
Together with 22104463, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22104463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11052230 + 11052231.
It is an arithmetic number, because the mean of its divisors is an integer number (11052231).
Almost surely, 222104461 is an apocalyptic number.
It is an amenable number.
22104461 is a deficient number, since it is larger than the sum of its proper divisors (1).
22104461 is an equidigital number, since it uses as much as digits as its factorization.
22104461 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.
The square root of 22104461 is about 4701.5381525624. The cubic root of 22104461 is about 280.6467236322.
Adding to 22104461 its reverse (16440122), we get a palindrome (38544583).
The spelling of 22104461 in words is "twenty-two million, one hundred four thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •