Base | Representation |
---|---|
bin | 11101111000110100010… |
… | …11111000111010100101 |
3 | 10122011200222012210222001 |
4 | 32330122023320322211 |
5 | 113311131221224234 |
6 | 2103433525205301 |
7 | 134123305202353 |
oct | 16743213707245 |
9 | 3564628183861 |
10 | 1026936508069 |
11 | 36658098310a |
12 | 14703ab60831 |
13 | 75abba78c04 |
14 | 379bda7c7d3 |
15 | 1baa6458d14 |
hex | ef1a2f8ea5 |
1026936508069 has 2 divisors, whose sum is σ = 1026936508070. Its totient is φ = 1026936508068.
The previous prime is 1026936508067. The next prime is 1026936508097. The reversal of 1026936508069 is 9608056396201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 742380408225 + 284556099844 = 861615^2 + 533438^2 .
It is a cyclic number.
It is not a de Polignac number, because 1026936508069 - 21 = 1026936508067 is a prime.
It is a super-2 number, since 2×10269365080692 (a number of 25 digits) contains 22 as substring.
Together with 1026936508067, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1026936508067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 513468254034 + 513468254035.
It is an arithmetic number, because the mean of its divisors is an integer number (513468254035).
Almost surely, 21026936508069 is an apocalyptic number.
It is an amenable number.
1026936508069 is a deficient number, since it is larger than the sum of its proper divisors (1).
1026936508069 is an equidigital number, since it uses as much as digits as its factorization.
1026936508069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4199040, while the sum is 55.
The spelling of 1026936508069 in words is "one trillion, twenty-six billion, nine hundred thirty-six million, five hundred eight thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •