Base | Representation |
---|---|
bin | 11000001110000111… |
… | …010011100101010101 |
3 | 2111010110000011110012 |
4 | 120032013103211111 |
5 | 411230142200041 |
6 | 15540335410005 |
7 | 1610316311213 |
oct | 301607234525 |
9 | 74113004405 |
10 | 26006600021 |
11 | 10036058576 |
12 | 5059683905 |
13 | 25b5c4482c |
14 | 1389d31cb3 |
15 | a232593eb |
hex | 60e1d3955 |
26006600021 has 4 divisors (see below), whose sum is σ = 26298809100. Its totient is φ = 25714390944.
The previous prime is 26006599981. The next prime is 26006600083. The reversal of 26006600021 is 12000660062.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5371277521 + 20635322500 = 73289^2 + 143650^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-26006600021 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 26006600021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26006605021) 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, 146104406 + ... + 146104583.
It is an arithmetic number, because the mean of its divisors is an integer number (6574702275).
Almost surely, 226006600021 is an apocalyptic number.
It is an amenable number.
26006600021 is a deficient number, since it is larger than the sum of its proper divisors (292209079).
26006600021 is an equidigital number, since it uses as much as digits as its factorization.
26006600021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292209078.
The product of its (nonzero) digits is 864, while the sum is 23.
The spelling of 26006600021 in words is "twenty-six billion, six million, six hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •