Search a number
-
+
110056050005101 = 1911035251517393
BaseRepresentation
bin11001000001100001101011…
…110001000001010001101101
3112102200020220100112001111221
4121001201223301001101231
5103411124242300130401
61030023015033543341
732116200341636254
oct3101415361012155
9472606810461457
10110056050005101
1132081566088662
1210415724574b51
134954319597755
141d26a53d7979b
15cacc252bb7a1
hex64186bc4146d

110056050005101 has 8 divisors (see below), whose sum is σ = 115953504059520. Its totient is φ = 104169098987712.

The previous prime is 110056050005003. The next prime is 110056050005197. The reversal of 110056050005101 is 101500050650011.

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

It is not a de Polignac number, because 110056050005101 - 27 = 110056050004973 is a prime.

It is a super-2 number, since 2×1100560500051012 (a number of 29 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 (110056050005801) 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, 2625737740 + ... + 2625779653.

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

Almost surely, 2110056050005101 is an apocalyptic number.

It is an amenable number.

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

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

110056050005101 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 5251518515.

The product of its (nonzero) digits is 750, while the sum is 25.

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

Divisors: 1 19 1103 20957 5251517393 99778830467 5792423684479 110056050005101