Base | Representation |
---|---|
bin | 11111110111100000111… |
… | …01111010110011011101 |
3 | 10212200021101000110212201 |
4 | 33323300131322303131 |
5 | 120414432223134221 |
6 | 2155003232331501 |
7 | 142052014004422 |
oct | 17736035726335 |
9 | 3780241013781 |
10 | 1094956068061 |
11 | 3924061782a9 |
12 | 1582626a3b91 |
13 | 7c33bb0726b |
14 | 3add364bd49 |
15 | 1d737c6c891 |
hex | fef077acdd |
1094956068061 has 8 divisors (see below), whose sum is σ = 1100162254040. Its totient is φ = 1089758899008.
The previous prime is 1094956068049. The next prime is 1094956068077. The reversal of 1094956068061 is 1608606594901.
It can be written as a sum of positive squares in 4 ways, for example, as 338003867161 + 756952200900 = 581381^2 + 870030^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1094956068061 - 211 = 1094956066013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1094956067993 and 1094956068011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1094956068091) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2010726 + ... + 2496583.
It is an arithmetic number, because the mean of its divisors is an integer number (137520281755).
Almost surely, 21094956068061 is an apocalyptic number.
It is an amenable number.
1094956068061 is a deficient number, since it is larger than the sum of its proper divisors (5206185979).
1094956068061 is an equidigital number, since it uses as much as digits as its factorization.
1094956068061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4508463.
The product of its (nonzero) digits is 2799360, while the sum is 55.
The spelling of 1094956068061 in words is "one trillion, ninety-four billion, nine hundred fifty-six million, sixty-eight thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •