Base | Representation |
---|---|
bin | 110010001101… |
… | …1000010000111 |
3 | 1211112110021201 |
4 | 1210123002013 |
5 | 23214401002 |
6 | 2340123331 |
7 | 436521433 |
oct | 144330207 |
9 | 54473251 |
10 | 26325127 |
11 | 13950504 |
12 | 8996547 |
13 | 55b93ca |
14 | 36d39c3 |
15 | 24a0087 |
hex | 191b087 |
26325127 has 8 divisors (see below), whose sum is σ = 28666800. Its totient is φ = 24079104.
The previous prime is 26325119. The next prime is 26325139. The reversal of 26325127 is 72152362.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 26325127 - 23 = 26325119 is a prime.
It is a super-2 number, since 2×263251272 = 1386024623132258, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 26325095 and 26325104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26325227) 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 in 7 ways as a sum of consecutive naturals, for example, 23338 + ... + 24439.
It is an arithmetic number, because the mean of its divisors is an integer number (3583350).
Almost surely, 226325127 is an apocalyptic number.
26325127 is a deficient number, since it is larger than the sum of its proper divisors (2341673).
26325127 is a wasteful number, since it uses less digits than its factorization.
26325127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47825.
The product of its digits is 5040, while the sum is 28.
The square root of 26325127 is about 5130.8017891944. The cubic root of 26325127 is about 297.4793507783.
Adding to 26325127 its reverse (72152362), we get a palindrome (98477489).
The spelling of 26325127 in words is "twenty-six million, three hundred twenty-five thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •