Base | Representation |
---|---|
bin | 101010011111… |
… | …1110011110101 |
3 | 1112221000102022 |
4 | 1110333303311 |
5 | 21201001321 |
6 | 2113322525 |
7 | 360250346 |
oct | 124776365 |
9 | 45830368 |
10 | 22281461 |
11 | 11639434 |
12 | 7566445 |
13 | 48019c7 |
14 | 2d600cd |
15 | 1e51dab |
hex | 153fcf5 |
22281461 has 2 divisors, whose sum is σ = 22281462. Its totient is φ = 22281460.
The previous prime is 22281451. The next prime is 22281463. The reversal of 22281461 is 16418222.
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., 21436900 + 844561 = 4630^2 + 919^2 .
It is a cyclic number.
It is not a de Polignac number, because 22281461 - 214 = 22265077 is a prime.
Together with 22281463, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22281461.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22281463) 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, 11140730 + 11140731.
It is an arithmetic number, because the mean of its divisors is an integer number (11140731).
Almost surely, 222281461 is an apocalyptic number.
It is an amenable number.
22281461 is a deficient number, since it is larger than the sum of its proper divisors (1).
22281461 is an equidigital number, since it uses as much as digits as its factorization.
22281461 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1536, while the sum is 26.
The square root of 22281461 is about 4720.3242473373. The cubic root of 22281461 is about 281.3938197115.
Adding to 22281461 its reverse (16418222), we get a palindrome (38699683).
The spelling of 22281461 in words is "twenty-two million, two hundred eighty-one thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •