Base | Representation |
---|---|
bin | 1011110111110000111011… |
… | …11111100000100111101011 |
3 | 10102102122101020122112222002 |
4 | 11323320131333200213223 |
5 | 11410202140442204120 |
6 | 131304341010321215 |
7 | 5333022012205124 |
oct | 573703577404753 |
9 | 112378336575862 |
10 | 26105314413035 |
11 | 8355224470780 |
12 | 2b17474b8920b |
13 | 117494a188060 |
14 | 66370ac1504b |
15 | 3040d48b9375 |
hex | 17be1dfe09eb |
26105314413035 has 32 divisors (see below), whose sum is σ = 37167403089600. Its totient is φ = 17351728704000.
The previous prime is 26105314413011. The next prime is 26105314413053. The reversal of 26105314413035 is 53031441350162.
It is not a de Polignac number, because 26105314413035 - 210 = 26105314412011 is a prime.
It is a super-2 number, since 2×261053144130352 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 26105314413035.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 180674960 + ... + 180819389.
It is an arithmetic number, because the mean of its divisors is an integer number (1161481346550).
Almost surely, 226105314413035 is an apocalyptic number.
26105314413035 is a deficient number, since it is larger than the sum of its proper divisors (11062088676565).
26105314413035 is a wasteful number, since it uses less digits than its factorization.
26105314413035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 361494479.
The product of its (nonzero) digits is 129600, while the sum is 38.
Adding to 26105314413035 its reverse (53031441350162), we get a palindrome (79136755763197).
The spelling of 26105314413035 in words is "twenty-six trillion, one hundred five billion, three hundred fourteen million, four hundred thirteen thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •