Base | Representation |
---|---|
bin | 110010010111… |
… | …0100111100010 |
3 | 1211200112022210 |
4 | 1210232213202 |
5 | 23224432341 |
6 | 2341542550 |
7 | 440304342 |
oct | 144564742 |
9 | 54615283 |
10 | 26405346 |
11 | 139a5800 |
12 | 8a14a56 |
13 | 5616a86 |
14 | 3714d22 |
15 | 24b8c16 |
hex | 192e9e2 |
26405346 has 48 divisors (see below), whose sum is σ = 59677632. Its totient is φ = 7777440.
The previous prime is 26405329. The next prime is 26405363. The reversal of 26405346 is 64350462.
It is an interprime number because it is at equal distance from previous prime (26405329) and next prime (26405363).
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 26371 + ... + 27353.
It is an arithmetic number, because the mean of its divisors is an integer number (1243284).
Almost surely, 226405346 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26405346, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29838816).
26405346 is an abundant number, since it is smaller than the sum of its proper divisors (33272286).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26405346 is a wasteful number, since it uses less digits than its factorization.
26405346 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1047 (or 1036 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 30.
The square root of 26405346 is about 5138.6132370514. The cubic root of 26405346 is about 297.7812081092.
Subtracting 26405346 from its reverse (64350462), we obtain a triangular number (37945116 = T8711).
The spelling of 26405346 in words is "twenty-six million, four hundred five thousand, three hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •