Base | Representation |
---|---|
bin | 1000000110000101100… |
… | …1111010100010000101 |
3 | 111021222020122100102112 |
4 | 2001201121322202011 |
5 | 4234310210334043 |
6 | 143520031550405 |
7 | 13022235105104 |
oct | 2014131724205 |
9 | 437866570375 |
10 | 139073136773 |
11 | 53a8718407a |
12 | 22b5338b405 |
13 | 1016485130c |
14 | 6a344bc03b |
15 | 393e68a518 |
hex | 206167a885 |
139073136773 has 4 divisors (see below), whose sum is σ = 139779091980. Its totient is φ = 138367181568.
The previous prime is 139073136757. The next prime is 139073136781. The reversal of 139073136773 is 377631370931.
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: 377631370931 = 2341 ⋅161311991.
It can be written as a sum of positive squares in 2 ways, for example, as 64425607684 + 74647529089 = 253822^2 + 273217^2 .
It is a cyclic number.
It is not a de Polignac number, because 139073136773 - 24 = 139073136757 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 (139073136673) 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, 352977308 + ... + 352977701.
It is an arithmetic number, because the mean of its divisors is an integer number (34944772995).
Almost surely, 2139073136773 is an apocalyptic number.
It is an amenable number.
139073136773 is a deficient number, since it is larger than the sum of its proper divisors (705955207).
139073136773 is an equidigital number, since it uses as much as digits as its factorization.
139073136773 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 705955206.
The product of its (nonzero) digits is 1500282, while the sum is 50.
The spelling of 139073136773 in words is "one hundred thirty-nine billion, seventy-three million, one hundred thirty-six thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •