Base | Representation |
---|---|
bin | 10000101100000… |
… | …10011110110101 |
3 | 100202102111010021 |
4 | 20112002132311 |
5 | 241314320221 |
6 | 21520325141 |
7 | 3316636603 |
oct | 1026023665 |
9 | 322374107 |
10 | 139995061 |
11 | 720293a8 |
12 | 3aa737b1 |
13 | 2300801b |
14 | 14842873 |
15 | c455041 |
hex | 85827b5 |
139995061 has 4 divisors (see below), whose sum is σ = 142290124. Its totient is φ = 137700000.
The previous prime is 139995049. The next prime is 139995067. The reversal of 139995061 is 160599931.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5202961 + 134792100 = 2281^2 + 11610^2 .
It is a cyclic number.
It is not a de Polignac number, because 139995061 - 25 = 139995029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 139994999 and 139995017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139995067) 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 3 ways as a sum of consecutive naturals, for example, 1147440 + ... + 1147561.
It is an arithmetic number, because the mean of its divisors is an integer number (35572531).
Almost surely, 2139995061 is an apocalyptic number.
It is an amenable number.
139995061 is a deficient number, since it is larger than the sum of its proper divisors (2295063).
139995061 is an equidigital number, since it uses as much as digits as its factorization.
139995061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2295062.
The product of its (nonzero) digits is 65610, while the sum is 43.
The square root of 139995061 is about 11831.9508535152. The cubic root of 139995061 is about 519.2433039875.
The spelling of 139995061 in words is "one hundred thirty-nine million, nine hundred ninety-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •