Base | Representation |
---|---|
bin | 11111011111110100110100… |
… | …101101110100110010100111 |
3 | 200011111000000111110200121201 |
4 | 133133310310231310302213 |
5 | 121124104144421011311 |
6 | 1210342102422023331 |
7 | 41115130634206042 |
oct | 3737646455646247 |
9 | 604430014420551 |
10 | 138526464625831 |
11 | 4015881a9a3a57 |
12 | 13653434877b47 |
13 | 5c3acb30b8709 |
14 | 262ca0673dc59 |
15 | 11035d06c29c1 |
hex | 7dfd34b74ca7 |
138526464625831 has 8 divisors (see below), whose sum is σ = 140524196588928. Its totient is φ = 136530028635000.
The previous prime is 138526464625781. The next prime is 138526464625937.
138526464625831 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 138526464625831 - 221 = 138526462528679 is a prime.
It is a super-2 number, since 2×1385264646258312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138526464622831) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 323777745 + ... + 324205306.
It is an arithmetic number, because the mean of its divisors is an integer number (17565524573616).
Almost surely, 2138526464625831 is an apocalyptic number.
138526464625831 is a deficient number, since it is larger than the sum of its proper divisors (1997731963097).
138526464625831 is an equidigital number, since it uses as much as digits as its factorization.
138526464625831 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 647986133.
The product of its digits is 199065600, while the sum is 64.
The spelling of 138526464625831 in words is "one hundred thirty-eight trillion, five hundred twenty-six billion, four hundred sixty-four million, six hundred twenty-five thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •