Base | Representation |
---|---|
bin | 11000100110001011… |
… | …101110100001011001 |
3 | 2112011120211221111220 |
4 | 120212023232201121 |
5 | 413042031141441 |
6 | 20044402442253 |
7 | 1623321541032 |
oct | 304613564131 |
9 | 75146757456 |
10 | 26410412121 |
11 | 10222a97585 |
12 | 5150963389 |
13 | 264b7bc2c2 |
14 | 13c7809a89 |
15 | a48922466 |
hex | 6262ee859 |
26410412121 has 4 divisors (see below), whose sum is σ = 35213882832. Its totient is φ = 17606941412.
The previous prime is 26410412117. The next prime is 26410412123. The reversal of 26410412121 is 12121401462.
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.
It is a cyclic number.
It is not a de Polignac number, because 26410412121 - 22 = 26410412117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 26410412091 and 26410412100.
It is not an unprimeable number, because it can be changed into a prime (26410412123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4401735351 + ... + 4401735356.
It is an arithmetic number, because the mean of its divisors is an integer number (8803470708).
Almost surely, 226410412121 is an apocalyptic number.
It is an amenable number.
26410412121 is a deficient number, since it is larger than the sum of its proper divisors (8803470711).
26410412121 is an equidigital number, since it uses as much as digits as its factorization.
26410412121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8803470710.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 26410412121 its reverse (12121401462), we get a palindrome (38531813583).
The spelling of 26410412121 in words is "twenty-six billion, four hundred ten million, four hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •