Search a number
-
+
1055106101101 = 13586913828933
BaseRepresentation
bin11110101101010010011…
…10010110111101101101
310201212102011021102000111
433112221032112331231
5114241324130213401
62124413053300021
7136141340611633
oct17265116267555
93655364242014
101055106101101
11377516984308
121505a0a94611
137865ab65960
14390d2d77353
151c6a451ee51
hexf5a9396f6d

1055106101101 has 8 divisors (see below), whose sum is σ = 1136461796120. Its totient is φ = 973778075712.

The previous prime is 1055106101051. The next prime is 1055106101117. The reversal of 1055106101101 is 1011016015501.

It can be written as a sum of positive squares in 4 ways, for example, as 4688140900 + 1050417960201 = 68470^2 + 1024899^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 1055106101101 - 27 = 1055106100973 is a prime.

It is a super-2 number, since 2×10551061011012 (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 (1055106101131) 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, 6838170 + ... + 6990763.

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

Almost surely, 21055106101101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 13834815.

The product of its (nonzero) digits is 150, while the sum is 22.

The spelling of 1055106101101 in words is "one trillion, fifty-five billion, one hundred six million, one hundred one thousand, one hundred one".

Divisors: 1 13 5869 76297 13828933 179776129 81162007777 1055106101101