Base | Representation |
---|---|
bin | 1011110111010011111100… |
… | …11011010011011010010001 |
3 | 10102101011012201001112122111 |
4 | 11323221332123103122101 |
5 | 11404423303111130023 |
6 | 131253244455305321 |
7 | 5331631246506514 |
oct | 573517633233221 |
9 | 112334181045574 |
10 | 26089752442513 |
11 | 8349669105a11 |
12 | 2b1445137b241 |
13 | 117333a09a086 |
14 | 662a72106d7b |
15 | 3039c359a00d |
hex | 17ba7e6d3691 |
26089752442513 has 2 divisors, whose sum is σ = 26089752442514. Its totient is φ = 26089752442512.
The previous prime is 26089752442487. The next prime is 26089752442547. The reversal of 26089752442513 is 31524425798062.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15875387578449 + 10214364864064 = 3984393^2 + 3195992^2 .
It is a cyclic number.
It is not a de Polignac number, because 26089752442513 - 29 = 26089752442001 is a prime.
It is a super-2 number, since 2×260897524425132 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (26089752445513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13044876221256 + 13044876221257.
It is an arithmetic number, because the mean of its divisors is an integer number (13044876221257).
It is a 1-persistent number, because it is pandigital, but 2⋅26089752442513 = 52179504885026 is not.
Almost surely, 226089752442513 is an apocalyptic number.
It is an amenable number.
26089752442513 is a deficient number, since it is larger than the sum of its proper divisors (1).
26089752442513 is an equidigital number, since it uses as much as digits as its factorization.
26089752442513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29030400, while the sum is 58.
The spelling of 26089752442513 in words is "twenty-six trillion, eighty-nine billion, seven hundred fifty-two million, four hundred forty-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •