Base | Representation |
---|---|
bin | 110010110010… |
… | …0000011110001 |
3 | 1212002122121000 |
4 | 1211210003301 |
5 | 23303433431 |
6 | 2350352213 |
7 | 442205460 |
oct | 145440361 |
9 | 55078530 |
10 | 26624241 |
11 | 14035206 |
12 | 8abb669 |
13 | 56925b7 |
14 | 37709d7 |
15 | 250d9e6 |
hex | 19640f1 |
26624241 has 16 divisors (see below), whose sum is σ = 45078400. Its totient is φ = 15213744.
The previous prime is 26624239. The next prime is 26624249. The reversal of 26624241 is 14242662.
It is not a de Polignac number, because 26624241 - 21 = 26624239 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26624249) 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 15 ways as a sum of consecutive naturals, for example, 70246 + ... + 70623.
It is an arithmetic number, because the mean of its divisors is an integer number (2817400).
Almost surely, 226624241 is an apocalyptic number.
26624241 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
26624241 is a deficient number, since it is larger than the sum of its proper divisors (18454159).
26624241 is a wasteful number, since it uses less digits than its factorization.
26624241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140885 (or 140879 counting only the distinct ones).
The product of its digits is 4608, while the sum is 27.
The square root of 26624241 is about 5159.8683122731. The cubic root of 26624241 is about 298.6017935194.
It can be divided in two parts, 2662 and 4241, that added together give a triangular number (6903 = T117).
The spelling of 26624241 in words is "twenty-six million, six hundred twenty-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •