Base | Representation |
---|---|
bin | 1011111110101010111101… |
… | …00010011001111111101100 |
3 | 10110021022220111221000112220 |
4 | 11333111132202121333230 |
5 | 11423044141322112134 |
6 | 132005344403355340 |
7 | 5356122456535635 |
oct | 577253642317754 |
9 | 113238814830486 |
10 | 26342620504044 |
11 | 843692a584249 |
12 | 2b55462382b50 |
13 | 11911383c65a0 |
14 | 670dbd7b888c |
15 | 30a373095149 |
hex | 17f55e899fec |
26342620504044 has 48 divisors (see below), whose sum is σ = 67443225810912. Its totient is φ = 7952489206272.
The previous prime is 26342620504019. The next prime is 26342620504069. The reversal of 26342620504044 is 44040502624362.
It is an interprime number because it is at equal distance from previous prime (26342620504019) and next prime (26342620504069).
It is a junction number, because it is equal to n+sod(n) for n = 26342620503987 and 26342620504005.
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 15 ways as a sum of consecutive naturals, for example, 1593038449 + ... + 1593054984.
It is an arithmetic number, because the mean of its divisors is an integer number (1405067204394).
Almost surely, 226342620504044 is an apocalyptic number.
It is an amenable number.
26342620504044 is an abundant number, since it is smaller than the sum of its proper divisors (41100605306868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26342620504044 is a wasteful number, since it uses less digits than its factorization.
26342620504044 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3186093506 (or 3186093504 counting only the distinct ones).
The product of its (nonzero) digits is 1105920, while the sum is 42.
The spelling of 26342620504044 in words is "twenty-six trillion, three hundred forty-two billion, six hundred twenty million, five hundred four thousand, forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •