Search a number
-
+
1101110001093 = 32122345555677
BaseRepresentation
bin10000000001011111010…
…001010011110111000101
310220021011020201122222100
4100001133101103313011
5121020033130013333
62201502024422313
7142360350403224
oct20013721236705
93807136648870
101101110001093
11394a83987273
1215949b617999
137caaca4b15b
143b418a8acbb
151d998160213
hex1005f453dc5

1101110001093 has 6 divisors (see below), whose sum is σ = 1590492223814. Its totient is φ = 734073334056.

The previous prime is 1101110001053. The next prime is 1101110001097. The reversal of 1101110001093 is 3901000111011.

It can be written as a sum of positive squares in only one way, i.e., 874670116644 + 226439884449 = 935238^2 + 475857^2 .

It is not a de Polignac number, because 1101110001093 - 29 = 1101110000581 is a prime.

It is a super-2 number, since 2×11011100010932 (a number of 25 digits) contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1101110001097) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 61172777830 + ... + 61172777847.

Almost surely, 21101110001093 is an apocalyptic number.

It is an amenable number.

1101110001093 is a deficient number, since it is larger than the sum of its proper divisors (489382222721).

1101110001093 is a wasteful number, since it uses less digits than its factorization.

1101110001093 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 122345555683 (or 122345555680 counting only the distinct ones).

The product of its (nonzero) digits is 27, while the sum is 18.

The spelling of 1101110001093 in words is "one trillion, one hundred one billion, one hundred ten million, one thousand, ninety-three".

Divisors: 1 3 9 122345555677 367036667031 1101110001093