Base | Representation |
---|---|
bin | 110001101001… |
… | …0001111111001 |
3 | 1210222022100000 |
4 | 1203102033321 |
5 | 23130331001 |
6 | 2325503213 |
7 | 434140320 |
oct | 143221771 |
9 | 53868300 |
10 | 26027001 |
11 | 13767520 |
12 | 8871b09 |
13 | 55137c0 |
14 | 36570b7 |
15 | 2441a86 |
hex | 18d23f9 |
26027001 has 96 divisors (see below), whose sum is σ = 52835328. Its totient is φ = 12363840.
The previous prime is 26026991. The next prime is 26027003. The reversal of 26027001 is 10072062.
It is a happy number.
It is not a de Polignac number, because 26027001 - 26 = 26026937 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26027003) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 243190 + ... + 243296.
It is an arithmetic number, because the mean of its divisors is an integer number (550368).
Almost surely, 226027001 is an apocalyptic number.
26027001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
26027001 is an abundant number, since it is smaller than the sum of its proper divisors (26808327).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26027001 is a wasteful number, since it uses less digits than its factorization.
26027001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 153 (or 141 counting only the distinct ones).
The product of its (nonzero) digits is 168, while the sum is 18.
The square root of 26027001 is about 5101.6664924317. Note that the first 3 decimals coincide. The cubic root of 26027001 is about 296.3521231001.
Adding to 26027001 its reverse (10072062), we get a palindrome (36099063).
It can be divided in two parts, 260 and 27001, that added together give a triangular number (27261 = T233).
The spelling of 26027001 in words is "twenty-six million, twenty-seven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •