Search a number
-
+
69060141 = 337932377
BaseRepresentation
bin1000001110111…
…00011000101101
311210221121201000
410013130120231
5120134411031
610504110513
71466000343
oct407343055
9153847630
1069060141
1135a899a7
121b165439
13113ccab7
149259993
1560e23e6
hex41dc62d

69060141 has 16 divisors (see below), whose sum is σ = 103609600. Its totient is φ = 45455904.

The previous prime is 69060139. The next prime is 69060143. The reversal of 69060141 is 14106096.

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

It is not a de Polignac number, because 69060141 - 21 = 69060139 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (27).

It is a Duffinian number.

It is a congruent number.

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

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

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

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

Almost surely, 269060141 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 1296, while the sum is 27.

The square root of 69060141 is about 8310.2431372373. The cubic root of 69060141 is about 410.2757237161.

The spelling of 69060141 in words is "sixty-nine million, sixty thousand, one hundred forty-one".

Divisors: 1 3 9 27 79 237 711 2133 32377 97131 291393 874179 2557783 7673349 23020047 69060141