Base | Representation |
---|---|
bin | 110010110100… |
… | …0010000010111 |
3 | 1212010112011200 |
4 | 1211220100113 |
5 | 23310011211 |
6 | 2351003543 |
7 | 442306545 |
oct | 145502027 |
9 | 55115150 |
10 | 26641431 |
11 | 14047113 |
12 | 8b095b3 |
13 | 569a37b |
14 | 3776d95 |
15 | 2513b56 |
hex | 1968417 |
26641431 has 48 divisors (see below), whose sum is σ = 43400448. Its totient is φ = 15667200.
The previous prime is 26641427. The next prime is 26641441. The reversal of 26641431 is 13414662.
It is not a de Polignac number, because 26641431 - 22 = 26641427 is a prime.
It is a super-2 number, since 2×266414312 = 1419531691455522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 26641395 and 26641404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26641441) 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 47 ways as a sum of consecutive naturals, for example, 194395 + ... + 194531.
It is an arithmetic number, because the mean of its divisors is an integer number (904176).
Almost surely, 226641431 is an apocalyptic number.
26641431 is a deficient number, since it is larger than the sum of its proper divisors (16759017).
26641431 is a wasteful number, since it uses less digits than its factorization.
26641431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232 (or 229 counting only the distinct ones).
The product of its digits is 3456, while the sum is 27.
The square root of 26641431 is about 5161.5337836732. The cubic root of 26641431 is about 298.6660439961. Note that the first 3 decimals are identical.
It can be divided in two parts, 26641 and 431, that added together give a palindrome (27072).
The spelling of 26641431 in words is "twenty-six million, six hundred forty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •