Base | Representation |
---|---|
bin | 1100000001000000011000… |
… | …10110100010011111010101 |
3 | 10110112222222120102111202012 |
4 | 12000200030112202133111 |
5 | 11430402442041240041 |
6 | 132110253215154005 |
7 | 5364662520411554 |
oct | 600401426423725 |
9 | 113488876374665 |
10 | 26422846040021 |
11 | 84679588248a2 |
12 | 2b68b11815905 |
13 | 1198882186832 |
14 | 674c304a1d9b |
15 | 30c4bb2643eb |
hex | 18080c5a27d5 |
26422846040021 has 2 divisors, whose sum is σ = 26422846040022. Its totient is φ = 26422846040020.
The previous prime is 26422846039963. The next prime is 26422846040023. The reversal of 26422846040021 is 12004064822462.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18857210715121 + 7565635324900 = 4342489^2 + 2750570^2 .
It is a cyclic number.
It is not a de Polignac number, because 26422846040021 - 230 = 26421772298197 is a prime.
It is a super-2 number, since 2×264228460400212 (a number of 28 digits) contains 22 as substring.
Together with 26422846040023, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (26422846040023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13211423020010 + 13211423020011.
It is an arithmetic number, because the mean of its divisors is an integer number (13211423020011).
Almost surely, 226422846040021 is an apocalyptic number.
It is an amenable number.
26422846040021 is a deficient number, since it is larger than the sum of its proper divisors (1).
26422846040021 is an equidigital number, since it uses as much as digits as its factorization.
26422846040021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 294912, while the sum is 41.
The spelling of 26422846040021 in words is "twenty-six trillion, four hundred twenty-two billion, eight hundred forty-six million, forty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •