Base | Representation |
---|---|
bin | 1000000111101010100… |
… | …0001110101011010101 |
3 | 111100001201221021021022 |
4 | 2001322220032223111 |
5 | 4241142024212301 |
6 | 144030030130525 |
7 | 13035564103424 |
oct | 2017250165325 |
9 | 440051837238 |
10 | 139496319701 |
11 | 54184043732 |
12 | 23051050a45 |
13 | 1020141ba0b |
14 | 6a747992bb |
15 | 39668ccd1b |
hex | 207aa0ead5 |
139496319701 has 4 divisors (see below), whose sum is σ = 142898669004. Its totient is φ = 136093970400.
The previous prime is 139496319679. The next prime is 139496319707. The reversal of 139496319701 is 107913694931.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 107913694931 = 7 ⋅15416242133.
It can be written as a sum of positive squares in 2 ways, for example, as 73666102225 + 65830217476 = 271415^2 + 256574^2 .
It is a cyclic number.
It is not a de Polignac number, because 139496319701 - 210 = 139496318677 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139496319707) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1701174590 + ... + 1701174671.
It is an arithmetic number, because the mean of its divisors is an integer number (35724667251).
Almost surely, 2139496319701 is an apocalyptic number.
It is an amenable number.
139496319701 is a deficient number, since it is larger than the sum of its proper divisors (3402349303).
139496319701 is an equidigital number, since it uses as much as digits as its factorization.
139496319701 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3402349302.
The product of its (nonzero) digits is 1102248, while the sum is 53.
The spelling of 139496319701 in words is "one hundred thirty-nine billion, four hundred ninety-six million, three hundred nineteen thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •