Base | Representation |
---|---|
bin | 1001110011001100110010… |
… | …0000110000001111101001 |
3 | 1102011002200211221122010011 |
4 | 2130303030200300033221 |
5 | 2403020112013213044 |
6 | 34530021314451521 |
7 | 2161324504202425 |
oct | 234631440601751 |
9 | 42132624848104 |
10 | 10775209116649 |
11 | 348481670116a |
12 | 1260383893ba1 |
13 | 602136cc8443 |
14 | 293746bc3b85 |
15 | 13a44babd134 |
hex | 9cccc8303e9 |
10775209116649 has 2 divisors, whose sum is σ = 10775209116650. Its totient is φ = 10775209116648.
The previous prime is 10775209116569. The next prime is 10775209116673. The reversal of 10775209116649 is 94661190257701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7086669926400 + 3688539190249 = 2662080^2 + 1920557^2 .
It is a cyclic number.
It is not a de Polignac number, because 10775209116649 - 211 = 10775209114601 is a prime.
It is a super-2 number, since 2×107752091166492 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10775209116593 and 10775209116602.
It is not a weakly prime, because it can be changed into another prime (10775209110649) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5387604558324 + 5387604558325.
It is an arithmetic number, because the mean of its divisors is an integer number (5387604558325).
Almost surely, 210775209116649 is an apocalyptic number.
It is an amenable number.
10775209116649 is a deficient number, since it is larger than the sum of its proper divisors (1).
10775209116649 is an equidigital number, since it uses as much as digits as its factorization.
10775209116649 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5715360, while the sum is 58.
The spelling of 10775209116649 in words is "ten trillion, seven hundred seventy-five billion, two hundred nine million, one hundred sixteen thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •