Base | Representation |
---|---|
bin | 11000110111101000… |
… | …110101100111100001 |
3 | 2112220222212221211201 |
4 | 120313220311213201 |
5 | 414142013143113 |
6 | 20133423241201 |
7 | 1633505634256 |
oct | 306750654741 |
9 | 75828787751 |
10 | 26703256033 |
11 | 10363323543 |
12 | 5212a49201 |
13 | 2697382b1c |
14 | 141467942d |
15 | a644bacdd |
hex | 637a359e1 |
26703256033 has 2 divisors, whose sum is σ = 26703256034. Its totient is φ = 26703256032.
The previous prime is 26703256009. The next prime is 26703256049. The reversal of 26703256033 is 33065230762.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 26118438544 + 584817489 = 161612^2 + 24183^2 .
It is a cyclic number.
It is not a de Polignac number, because 26703256033 - 29 = 26703255521 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 26703255983 and 26703256001.
It is not a weakly prime, because it can be changed into another prime (26703256133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13351628016 + 13351628017.
It is an arithmetic number, because the mean of its divisors is an integer number (13351628017).
Almost surely, 226703256033 is an apocalyptic number.
It is an amenable number.
26703256033 is a deficient number, since it is larger than the sum of its proper divisors (1).
26703256033 is an equidigital number, since it uses as much as digits as its factorization.
26703256033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 136080, while the sum is 37.
Adding to 26703256033 its reverse (33065230762), we get a palindrome (59768486795).
The spelling of 26703256033 in words is "twenty-six billion, seven hundred three million, two hundred fifty-six thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •