Base | Representation |
---|---|
bin | 1100000000100110110010… |
… | …01110001111000101111001 |
3 | 10110111200111211002011202220 |
4 | 12000103121032033011321 |
5 | 11430141320422323023 |
6 | 132100101413114253 |
7 | 5363665125301641 |
oct | 600233116170571 |
9 | 113450454064686 |
10 | 26409103323513 |
11 | 8462046384549 |
12 | 2b66317328989 |
13 | 11974a1c6a611 |
14 | 6742c923d521 |
15 | 30be64a033e3 |
hex | 1804d938f179 |
26409103323513 has 64 divisors (see below), whose sum is σ = 40610676326400. Its totient is φ = 15166329108480.
The previous prime is 26409103323511. The next prime is 26409103323521. The reversal of 26409103323513 is 31532330190462.
It is not a de Polignac number, because 26409103323513 - 21 = 26409103323511 is a prime.
It is a super-3 number, since 3×264091033235133 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (26409103323511) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 843823 + ... + 7316436.
It is an arithmetic number, because the mean of its divisors is an integer number (634541817600).
Almost surely, 226409103323513 is an apocalyptic number.
26409103323513 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
26409103323513 is a deficient number, since it is larger than the sum of its proper divisors (14201573002887).
26409103323513 is a wasteful number, since it uses less digits than its factorization.
26409103323513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8160422.
The product of its (nonzero) digits is 349920, while the sum is 42.
The spelling of 26409103323513 in words is "twenty-six trillion, four hundred nine billion, one hundred three million, three hundred twenty-three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •