Base | Representation |
---|---|
bin | 1011111011111100010000… |
… | …00100011110011110100001 |
3 | 10102221100210221211012020022 |
4 | 11331332020010132132201 |
5 | 11420030044433130031 |
6 | 131454313425123225 |
7 | 5346262266560312 |
oct | 575761004363641 |
9 | 112840727735208 |
10 | 26248828020641 |
11 | 840007a126256 |
12 | 2b3b247489515 |
13 | 118533b96c2b5 |
14 | 66a642d44609 |
15 | 307bd3cd497b |
hex | 17df8811e7a1 |
26248828020641 has 4 divisors (see below), whose sum is σ = 26481118534212. Its totient is φ = 26016537507072.
The previous prime is 26248828020631. The next prime is 26248828020659. The reversal of 26248828020641 is 14602082884262.
It is a happy number.
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 4408824078400 + 21840003942241 = 2099720^2 + 4673329^2 .
It is a cyclic number.
It is not a de Polignac number, because 26248828020641 - 238 = 25973950113697 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (26248828020631) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 116145256616 + ... + 116145256841.
It is an arithmetic number, because the mean of its divisors is an integer number (6620279633553).
Almost surely, 226248828020641 is an apocalyptic number.
It is an amenable number.
26248828020641 is a deficient number, since it is larger than the sum of its proper divisors (232290513571).
26248828020641 is a wasteful number, since it uses less digits than its factorization.
26248828020641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 232290513570.
The product of its (nonzero) digits is 4718592, while the sum is 53.
The spelling of 26248828020641 in words is "twenty-six trillion, two hundred forty-eight billion, eight hundred twenty-eight million, twenty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •