Base | Representation |
---|---|
bin | 1011111111010011001100… |
… | …01100101011100111010011 |
3 | 10110100101200002110101010222 |
4 | 11333221212030223213103 |
5 | 11423422412302111001 |
6 | 132023320210343255 |
7 | 5360516021213321 |
oct | 577514614534723 |
9 | 113311602411128 |
10 | 26364223863251 |
11 | 844500606981a |
12 | 2b5969128ab2b |
13 | 119319c011c81 |
14 | 67206c9cad11 |
15 | 30abd997561b |
hex | 17fa6632b9d3 |
26364223863251 has 2 divisors, whose sum is σ = 26364223863252. Its totient is φ = 26364223863250.
The previous prime is 26364223863203. The next prime is 26364223863253. The reversal of 26364223863251 is 15236832246362.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-26364223863251 is a prime.
It is a super-2 number, since 2×263642238632512 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 26364223863253, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 26364223863193 and 26364223863202.
It is not a weakly prime, because it can be changed into another prime (26364223863253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13182111931625 + 13182111931626.
It is an arithmetic number, because the mean of its divisors is an integer number (13182111931626).
Almost surely, 226364223863251 is an apocalyptic number.
26364223863251 is a deficient number, since it is larger than the sum of its proper divisors (1).
26364223863251 is an equidigital number, since it uses as much as digits as its factorization.
26364223863251 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14929920, while the sum is 53.
The spelling of 26364223863251 in words is "twenty-six trillion, three hundred sixty-four billion, two hundred twenty-three million, eight hundred sixty-three thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.508 sec. • engine limits •