Base | Representation |
---|---|
bin | 110010100101… |
… | …0111000110101 |
3 | 1211220102011111 |
4 | 1211022320311 |
5 | 23242134031 |
6 | 2344235021 |
7 | 441266053 |
oct | 145127065 |
9 | 54812144 |
10 | 26521141 |
11 | 13a747a9 |
12 | 8a6ba71 |
13 | 56576aa |
14 | 37451d3 |
15 | 24dd1b1 |
hex | 194ae35 |
26521141 has 4 divisors (see below), whose sum is σ = 26544672. Its totient is φ = 26497612.
The previous prime is 26521129. The next prime is 26521211. The reversal of 26521141 is 14112562.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 14112562 = 2 ⋅7056281.
It is a cyclic number.
It is not a de Polignac number, because 26521141 - 213 = 26512949 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26521441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9985 + ... + 12358.
It is an arithmetic number, because the mean of its divisors is an integer number (6636168).
Almost surely, 226521141 is an apocalyptic number.
It is an amenable number.
26521141 is a deficient number, since it is larger than the sum of its proper divisors (23531).
26521141 is a wasteful number, since it uses less digits than its factorization.
26521141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23530.
The product of its digits is 480, while the sum is 22.
The square root of 26521141 is about 5149.8680565622. The cubic root of 26521141 is about 298.2158586477.
It can be divided in two parts, 26521 and 141, that added together give a palindrome (26662).
The spelling of 26521141 in words is "twenty-six million, five hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •