Base | Representation |
---|---|
bin | 1100000000011001101100… |
… | …11000101000100101101001 |
3 | 10110111000101002200021012221 |
4 | 12000030312120220211221 |
5 | 11430032423024132011 |
6 | 132052540233434041 |
7 | 5363326031351314 |
oct | 600146630504551 |
9 | 113430332607187 |
10 | 26402076395881 |
11 | 845a06a90883a |
12 | 2b64a95b6b921 |
13 | 11969221c6c84 |
14 | 673c1dcb397b |
15 | 30bba2b6a971 |
hex | 180336628969 |
26402076395881 has 2 divisors, whose sum is σ = 26402076395882. Its totient is φ = 26402076395880.
The previous prime is 26402076395869. The next prime is 26402076395917. The reversal of 26402076395881 is 18859367020462.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15909400618281 + 10492675777600 = 3988659^2 + 3239240^2 .
It is a cyclic number.
It is not a de Polignac number, because 26402076395881 - 221 = 26402074298729 is a prime.
It is a super-2 number, since 2×264020763958812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (26402076395381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13201038197940 + 13201038197941.
It is an arithmetic number, because the mean of its divisors is an integer number (13201038197941).
It is a 1-persistent number, because it is pandigital, but 2⋅26402076395881 = 52804152791762 is not.
Almost surely, 226402076395881 is an apocalyptic number.
It is an amenable number.
26402076395881 is a deficient number, since it is larger than the sum of its proper divisors (1).
26402076395881 is an equidigital number, since it uses as much as digits as its factorization.
26402076395881 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34836480, while the sum is 61.
The spelling of 26402076395881 in words is "twenty-six trillion, four hundred two billion, seventy-six million, three hundred ninety-five thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •