Base | Representation |
---|---|
bin | 11111100110111011010111… |
… | …000100100010111010101101 |
3 | 200020012122202220101010220011 |
4 | 133212323113010202322231 |
5 | 121210103214031422443 |
6 | 1211354215550053221 |
7 | 41165316251540005 |
oct | 3746732704427255 |
9 | 606178686333804 |
10 | 139014519795373 |
11 | 403267aa361542 |
12 | 13711b414aa211 |
13 | 5c7502264a071 |
14 | 26484a53c7005 |
15 | 1111147831b9d |
hex | 7e6ed7122ead |
139014519795373 has 2 divisors, whose sum is σ = 139014519795374. Its totient is φ = 139014519795372.
The previous prime is 139014519795367. The next prime is 139014519795439. The reversal of 139014519795373 is 373597915410931.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 71401181806084 + 67613337989289 = 8449922^2 + 8222733^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-139014519795373 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 139014519795299 and 139014519795308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (139014519795323) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69507259897686 + 69507259897687.
It is an arithmetic number, because the mean of its divisors is an integer number (69507259897687).
Almost surely, 2139014519795373 is an apocalyptic number.
It is an amenable number.
139014519795373 is a deficient number, since it is larger than the sum of its proper divisors (1).
139014519795373 is an equidigital number, since it uses as much as digits as its factorization.
139014519795373 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96446700, while the sum is 67.
The spelling of 139014519795373 in words is "one hundred thirty-nine trillion, fourteen billion, five hundred nineteen million, seven hundred ninety-five thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •