Search a number
-
+
103066151111 = 72111910064071
BaseRepresentation
bin101111111111100111…
…0001010100011000111
3100212000212010221211222
41133333032022203013
53142034413313421
6115203053150555
710306034554400
oct1377716124307
9325025127758
10103066151111
113a78a178890
1217b8478b45b
139946b15941
144dba3669a7
152a334e8cab
hex17ff38a8c7

103066151111 has 24 divisors (see below), whose sum is σ = 137676504960. Its totient is φ = 76084369200.

The previous prime is 103066151093. The next prime is 103066151113. The reversal of 103066151111 is 111151660301.

It is not a de Polignac number, because 103066151111 - 26 = 103066151047 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5021795 + ... + 5042276.

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

Almost surely, 2103066151111 is an apocalyptic number.

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

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

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

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

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

The product of its (nonzero) digits is 540, while the sum is 26.

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

Divisors: 1 7 11 19 49 77 133 209 539 931 1463 10241 10064071 70448497 110704781 191217349 493139479 774933467 1338521443 2103390839 5424534269 9369650101 14723735873 103066151111