Base | Representation |
---|---|
bin | 1011110111001101000111… |
… | …00010001001000001000010 |
3 | 10102100210201202202101101210 |
4 | 11323212203202021001002 |
5 | 11404343242441242032 |
6 | 131251440230510550 |
7 | 5331441244461051 |
oct | 573464342110102 |
9 | 112323652671353 |
10 | 26086080024642 |
11 | 8348054125020 |
12 | 2b137a7505456 |
13 | 1172ba32b2a51 |
14 | 6628044a6398 |
15 | 30385ae812cc |
hex | 17b9a3889042 |
26086080024642 has 16 divisors (see below), whose sum is σ = 56915083690272. Its totient is φ = 7904872734720.
The previous prime is 26086080024629. The next prime is 26086080024649. The reversal of 26086080024642 is 24642008068062.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 26086080024591 and 26086080024600.
It is not an unprimeable number, because it can be changed into a prime (26086080024649) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 197621818303 + ... + 197621818434.
It is an arithmetic number, because the mean of its divisors is an integer number (3557192730642).
Almost surely, 226086080024642 is an apocalyptic number.
26086080024642 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
26086080024642 is an abundant number, since it is smaller than the sum of its proper divisors (30829003665630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26086080024642 is a wasteful number, since it uses less digits than its factorization.
26086080024642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 395243636753.
The product of its (nonzero) digits is 1769472, while the sum is 48.
The spelling of 26086080024642 in words is "twenty-six trillion, eighty-six billion, eighty million, twenty-four thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •