Search a number
-
+
1110705906081 = 3683372377487
BaseRepresentation
bin10000001010011011001…
…110110010000110100001
310221011221000010010221210
4100022123032302012201
5121144211202443311
62210130134140333
7143150220266502
oct20123316620641
93834830103853
101110705906081
11399058589762
1215b3191b16a9
138097bac2145
143ba892a0ba9
151dd5a7eb3a6
hex1029b3b21a1

1110705906081 has 16 divisors (see below), whose sum is σ = 1481560464384. Its totient is φ = 740161062144.

The previous prime is 1110705906067. The next prime is 1110705906181. The reversal of 1110705906081 is 1806095070111.

It is not a de Polignac number, because 1110705906081 - 215 = 1110705873313 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (1110705906181) 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 in 15 ways as a sum of consecutive naturals, for example, 148347520 + ... + 148355006.

It is an arithmetic number, because the mean of its divisors is an integer number (92597529024).

Almost surely, 21110705906081 is an apocalyptic number.

It is an amenable number.

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

1110705906081 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 21560.

The product of its (nonzero) digits is 15120, while the sum is 39.

The spelling of 1110705906081 in words is "one trillion, one hundred ten billion, seven hundred five million, nine hundred six thousand, eighty-one".

Divisors: 1 3 6833 7237 7487 20499 21711 22461 49450421 51158671 54183419 148351263 153476013 162550257 370235302027 1110705906081