Base | Representation |
---|---|
bin | 110010000100… |
… | …0110110000111 |
3 | 1211101200002121 |
4 | 1210020312013 |
5 | 23210010011 |
6 | 2334350411 |
7 | 436061311 |
oct | 144106607 |
9 | 54350077 |
10 | 26250631 |
11 | 138aa540 |
12 | 895b407 |
13 | 5591524 |
14 | 36b47b1 |
15 | 2487e71 |
hex | 1908d87 |
26250631 has 8 divisors (see below), whose sum is σ = 28905984. Its totient is φ = 23640120.
The previous prime is 26250629. The next prime is 26250643. The reversal of 26250631 is 13605262.
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 26250631 - 21 = 26250629 is a prime.
It is a super-2 number, since 2×262506312 = 1378191255796322, 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 = 26250596 and 26250605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26250031) 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, 9975 + ... + 12328.
It is an arithmetic number, because the mean of its divisors is an integer number (3613248).
Almost surely, 226250631 is an apocalyptic number.
26250631 is a deficient number, since it is larger than the sum of its proper divisors (2655353).
26250631 is a wasteful number, since it uses less digits than its factorization.
26250631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22421.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 26250631 is about 5123.5369619043. The cubic root of 26250631 is about 297.1984789618.
Adding to 26250631 its reverse (13605262), we get a palindrome (39855893).
The spelling of 26250631 in words is "twenty-six million, two hundred fifty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •