Search a number
-
+
111150136361 = 1191463110477
BaseRepresentation
bin110011110000100010…
…0000111110000101001
3101121220020120221212002
41213201010013300221
53310113413330421
6123021153100345
711013255366455
oct1474104076051
9347806527762
10111150136361
1143158399630
121965bb576b5
13a634883074
145545c53665
152d58083b0b
hex19e1107c29

111150136361 has 8 divisors (see below), whose sum is σ = 121257117504. Its totient is φ = 101043559120.

The previous prime is 111150136337. The next prime is 111150136373. The reversal of 111150136361 is 163631051111.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-111150136361 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (111150136381) 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, 950855 + ... + 1061331.

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

Almost surely, 2111150136361 is an apocalyptic number.

111150136361 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 201951.

The product of its (nonzero) digits is 1620, while the sum is 29.

Adding to 111150136361 its reverse (163631051111), we get a palindrome (274781187472).

The spelling of 111150136361 in words is "one hundred eleven billion, one hundred fifty million, one hundred thirty-six thousand, three hundred sixty-one".

Divisors: 1 11 91463 110477 1006093 1215247 10104557851 111150136361