Search a number
-
+
10660552132 = 222665138033
BaseRepresentation
bin10011110110110101…
…10001110111000100
31000111221201011022011
421323122301313010
5133313100132012
64521500344004
7525115124626
oct117332616704
930457634264
1010660552132
11458067066a
122096245004
13100b7c7419
14731b8cc16
15425d8c1a7
hex27b6b1dc4

10660552132 has 6 divisors (see below), whose sum is σ = 18655966238. Its totient is φ = 5330276064.

The previous prime is 10660552127. The next prime is 10660552139. The reversal of 10660552132 is 23125506601.

It can be written as a sum of positive squares in only one way, i.e., 6552254916 + 4108297216 = 80946^2 + 64096^2 .

It is a super-2 number, since 2×106605521322 (a number of 21 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 10660552094 and 10660552103.

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

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1332569013 + ... + 1332569020.

Almost surely, 210660552132 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 10800, while the sum is 31.

The spelling of 10660552132 in words is "ten billion, six hundred sixty million, five hundred fifty-two thousand, one hundred thirty-two".

Divisors: 1 2 4 2665138033 5330276066 10660552132