Search a number
-
+
1066161151 = 116710114323
BaseRepresentation
bin111111100011000…
…101001111111111
32202022011121011001
4333203011033333
54140414124101
6253443311131
735264135356
oct7743051777
92668147131
101066161151
114a7902720
1225907b4a7
1313cb635b3
14a185099d
15638ee901
hex3f8c53ff

1066161151 has 16 divisors (see below), whose sum is σ = 1192215168. Its totient is φ = 945252000.

The previous prime is 1066161139. The next prime is 1066161209. The reversal of 1066161151 is 1511616601.

It is not a de Polignac number, because 1066161151 - 217 = 1066030079 is a prime.

It is a super-2 number, since 2×10661611512 = 2273399199803289602, which 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 (1066161101) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 67276 + ... + 81598.

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

Almost surely, 21066161151 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 14502.

The product of its (nonzero) digits is 1080, while the sum is 28.

The square root of 1066161151 is about 32652.1232234598. The cubic root of 1066161151 is about 1021.5844754265.

Adding to 1066161151 its reverse (1511616601), we get a palindrome (2577777752).

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

Divisors: 1 11 67 101 737 1111 6767 14323 74437 157553 959641 1446623 10556051 15912853 96923741 1066161151