Base | Representation |
---|---|
bin | 110010001100… |
… | …0111011000001 |
3 | 1211112000102111 |
4 | 1210120323001 |
5 | 23214111411 |
6 | 2340015321 |
7 | 436454302 |
oct | 144307301 |
9 | 54460374 |
10 | 26316481 |
11 | 13944a64 |
12 | 8991541 |
13 | 55b54a9 |
14 | 36d07a9 |
15 | 249c721 |
hex | 1918ec1 |
26316481 has 2 divisors, whose sum is σ = 26316482. Its totient is φ = 26316480.
The previous prime is 26316449. The next prime is 26316487. The reversal of 26316481 is 18461362.
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., 24840256 + 1476225 = 4984^2 + 1215^2 .
It is a cyclic number.
It is not a de Polignac number, because 26316481 - 25 = 26316449 is a prime.
It is a super-2 number, since 2×263164812 = 1385114344446722, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (26316487) 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, 13158240 + 13158241.
It is an arithmetic number, because the mean of its divisors is an integer number (13158241).
Almost surely, 226316481 is an apocalyptic number.
It is an amenable number.
26316481 is a deficient number, since it is larger than the sum of its proper divisors (1).
26316481 is an equidigital number, since it uses as much as digits as its factorization.
26316481 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6912, while the sum is 31.
The square root of 26316481 is about 5129.9591616308. The cubic root of 26316481 is about 297.4467800194.
It can be divided in two parts, 26316 and 481, that multiplied together give a triangular number (12657996 = T5031).
The spelling of 26316481 in words is "twenty-six million, three hundred sixteen thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •