Base | Representation |
---|---|
bin | 1010000100010010011000… |
… | …0011111111111011010101 |
3 | 1110012011102120020022000221 |
4 | 2201010212003333323111 |
5 | 2422322314420214102 |
6 | 35312531124234341 |
7 | 2221456264500646 |
oct | 241044603777325 |
9 | 43164376208027 |
10 | 11068769304277 |
11 | 358826978a083 |
12 | 12a925053b9b1 |
13 | 623a1b8ba689 |
14 | 2a3a3494b6cd |
15 | 142dcdc19637 |
hex | a11260ffed5 |
11068769304277 has 2 divisors, whose sum is σ = 11068769304278. Its totient is φ = 11068769304276.
The previous prime is 11068769304191. The next prime is 11068769304319. The reversal of 11068769304277 is 77240396786011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7834098710916 + 3234670593361 = 2798946^2 + 1798519^2 .
It is a cyclic number.
It is not a de Polignac number, because 11068769304277 - 243 = 2272676282069 is a prime.
It is a super-2 number, since 2×110687693042772 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11068769304577) 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, 5534384652138 + 5534384652139.
It is an arithmetic number, because the mean of its divisors is an integer number (5534384652139).
Almost surely, 211068769304277 is an apocalyptic number.
It is an amenable number.
11068769304277 is a deficient number, since it is larger than the sum of its proper divisors (1).
11068769304277 is an equidigital number, since it uses as much as digits as its factorization.
11068769304277 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21337344, while the sum is 61.
The spelling of 11068769304277 in words is "eleven trillion, sixty-eight billion, seven hundred sixty-nine million, three hundred four thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •