Base | Representation |
---|---|
bin | 110011100001111110… |
… | …0100010001010010001 |
3 | 101120122012100011001002 |
4 | 1213003330202022101 |
5 | 3303113332424311 |
6 | 122500502151345 |
7 | 10665204101663 |
oct | 1470374421221 |
9 | 346565304032 |
10 | 110661608081 |
11 | 42a27658052 |
12 | 19544422555 |
13 | a5875b668b |
14 | 54db006533 |
15 | 2d2a23493b |
hex | 19c3f22291 |
110661608081 has 2 divisors, whose sum is σ = 110661608082. Its totient is φ = 110661608080.
The previous prime is 110661608063. The next prime is 110661608087. The reversal of 110661608081 is 180806166011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98822209600 + 11839398481 = 314360^2 + 108809^2 .
It is an emirp because it is prime and its reverse (180806166011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110661608081 - 230 = 109587866257 is a prime.
It is a super-3 number, since 3×1106616080813 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (110661608087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55330804040 + 55330804041.
It is an arithmetic number, because the mean of its divisors is an integer number (55330804041).
Almost surely, 2110661608081 is an apocalyptic number.
It is an amenable number.
110661608081 is a deficient number, since it is larger than the sum of its proper divisors (1).
110661608081 is an equidigital number, since it uses as much as digits as its factorization.
110661608081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 38.
The spelling of 110661608081 in words is "one hundred ten billion, six hundred sixty-one million, six hundred eight thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •