Base | Representation |
---|---|
bin | 10000101001001… |
… | …00011001011111 |
3 | 100201200220111110 |
4 | 20110210121133 |
5 | 241220002240 |
6 | 21504153103 |
7 | 3313443231 |
oct | 1024443137 |
9 | 321626443 |
10 | 139609695 |
11 | 71895915 |
12 | 3a908793 |
13 | 22c017b4 |
14 | 14782251 |
15 | c3cac80 |
hex | 852465f |
139609695 has 32 divisors (see below), whose sum is σ = 242923968. Its totient is φ = 68179968.
The previous prime is 139609681. The next prime is 139609711. The reversal of 139609695 is 596906931.
It is not a de Polignac number, because 139609695 - 211 = 139607647 is a prime.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 2037 + ... + 16833.
It is an arithmetic number, because the mean of its divisors is an integer number (7591374).
Almost surely, 2139609695 is an apocalyptic number.
139609695 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
139609695 is a deficient number, since it is larger than the sum of its proper divisors (103314273).
139609695 is a wasteful number, since it uses less digits than its factorization.
139609695 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14859.
The product of its (nonzero) digits is 393660, while the sum is 48.
The square root of 139609695 is about 11815.6546581220. The cubic root of 139609695 is about 518.7664238280.
The spelling of 139609695 in words is "one hundred thirty-nine million, six hundred nine thousand, six hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •