Search a number
-
+
139106595 = 359273773
BaseRepresentation
bin10000100101010…
…01100100100011
3100200202100101010
420102221210203
5241102402340
621445312003
73306246405
oct1022514443
9320670333
10139106595
1171581931
123a705603
1322a867c4
1414690b75
15c32bb80
hex84a9923

139106595 has 8 divisors (see below), whose sum is σ = 222570576. Its totient is φ = 74190176.

The previous prime is 139106587. The next prime is 139106623. The reversal of 139106595 is 595601931.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 139106595 - 23 = 139106587 is a prime.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4636872 + ... + 4636901.

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

Almost surely, 2139106595 is an apocalyptic number.

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

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

139106595 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 9273781.

The product of its (nonzero) digits is 36450, while the sum is 39.

The square root of 139106595 is about 11794.3458911463. The cubic root of 139106595 is about 518.1425284713.

The spelling of 139106595 in words is "one hundred thirty-nine million, one hundred six thousand, five hundred ninety-five".

Divisors: 1 3 5 15 9273773 27821319 46368865 139106595