Base | Representation |
---|---|
bin | 11111101001100110010100… |
… | …011011010110110100001011 |
3 | 200020212012120220020201122022 |
4 | 133221212110123112310023 |
5 | 121221110134313422441 |
6 | 1212014414555515055 |
7 | 41214505213541564 |
oct | 3751462433266413 |
9 | 606765526221568 |
10 | 139198085295371 |
11 | 40397638298633 |
12 | 13741631158a8b |
13 | 5c89427b8240b |
14 | 265331a95116b |
15 | 1115cdd08484b |
hex | 7e99946d6d0b |
139198085295371 has 2 divisors, whose sum is σ = 139198085295372. Its totient is φ = 139198085295370.
The previous prime is 139198085295307. The next prime is 139198085295403. The reversal of 139198085295371 is 173592580891931.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 139198085295371 - 26 = 139198085295307 is a prime.
It is a super-2 number, since 2×1391980852953712 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 139198085295295 and 139198085295304.
It is not a weakly prime, because it can be changed into another prime (139198085295671) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69599042647685 + 69599042647686.
It is an arithmetic number, because the mean of its divisors is an integer number (69599042647686).
Almost surely, 2139198085295371 is an apocalyptic number.
139198085295371 is a deficient number, since it is larger than the sum of its proper divisors (1).
139198085295371 is an equidigital number, since it uses as much as digits as its factorization.
139198085295371 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 146966400, while the sum is 71.
The spelling of 139198085295371 in words is "one hundred thirty-nine trillion, one hundred ninety-eight billion, eighty-five million, two hundred ninety-five thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •