Search a number
-
+
10501769439 = 327166694753
BaseRepresentation
bin10011100011111010…
…00100100011011111
31000002212221011101200
421301331010203133
5133001423110224
64454025210543
7521146365420
oct116175044337
930085834350
1010501769439
1144a9a7a8a7
122051030a53
13cb4941a75
14718a59647
15416e755c9
hex271f448df

10501769439 has 12 divisors (see below), whose sum is σ = 17336254416. Its totient is φ = 6001011072.

The previous prime is 10501769419. The next prime is 10501769461. The reversal of 10501769439 is 93496710501.

It is not a de Polignac number, because 10501769439 - 216 = 10501703903 is a prime.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10501769419) 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 in 11 ways as a sum of consecutive naturals, for example, 83347314 + ... + 83347439.

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

Almost surely, 210501769439 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 204120, while the sum is 45.

The spelling of 10501769439 in words is "ten billion, five hundred one million, seven hundred sixty-nine thousand, four hundred thirty-nine".

Divisors: 1 3 7 9 21 63 166694753 500084259 1166863271 1500252777 3500589813 10501769439