Search a number
-
+
110993157 = 32111121143
BaseRepresentation
bin1101001110110…
…01111100000101
321201212000222200
412213121330011
5211403240112
615002545113
72515266132
oct647317405
9251760880
10110993157
115771a890
1231208199
1319cc2432
1410a53589
159b26cdc
hex69d9f05

110993157 has 12 divisors (see below), whose sum is σ = 174898464. Its totient is φ = 67268520.

The previous prime is 110993143. The next prime is 110993171. The reversal of 110993157 is 751399011.

It is an interprime number because it is at equal distance from previous prime (110993143) and next prime (110993171).

It is not a de Polignac number, because 110993157 - 28 = 110992901 is a prime.

It is a super-3 number, since 3×1109931573 (a number of 25 digits) contains 333 as substring.

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 560473 + ... + 560670.

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

Almost surely, 2110993157 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 8505, while the sum is 36.

The square root of 110993157 is about 10535.3289934392. The cubic root of 110993157 is about 480.5796772687.

The spelling of 110993157 in words is "one hundred ten million, nine hundred ninety-three thousand, one hundred fifty-seven".

Divisors: 1 3 9 11 33 99 1121143 3363429 10090287 12332573 36997719 110993157