Base | Representation |
---|---|
bin | 110010011001… |
… | …0110010110101 |
3 | 1211201101210101 |
4 | 1210302302311 |
5 | 23231004303 |
6 | 2342154101 |
7 | 440405251 |
oct | 144626265 |
9 | 54641711 |
10 | 26422453 |
11 | 13a07642 |
12 | 8a22931 |
13 | 56217b5 |
14 | 371b261 |
15 | 24bdd1d |
hex | 1932cb5 |
26422453 has 2 divisors, whose sum is σ = 26422454. Its totient is φ = 26422452.
The previous prime is 26422421. The next prime is 26422481. The reversal of 26422453 is 35422462.
It is an a-pointer prime, because the next prime (26422481) can be obtained adding 26422453 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 26399044 + 23409 = 5138^2 + 153^2 .
It is a cyclic number.
It is not a de Polignac number, because 26422453 - 25 = 26422421 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (26422493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13211226 + 13211227.
It is an arithmetic number, because the mean of its divisors is an integer number (13211227).
Almost surely, 226422453 is an apocalyptic number.
It is an amenable number.
26422453 is a deficient number, since it is larger than the sum of its proper divisors (1).
26422453 is an equidigital number, since it uses as much as digits as its factorization.
26422453 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11520, while the sum is 28.
The square root of 26422453 is about 5140.2775216908. The cubic root of 26422453 is about 297.8455011937.
Subtracting 26422453 from its reverse (35422462), we obtain a palindrome (9000009).
The spelling of 26422453 in words is "twenty-six million, four hundred twenty-two thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •