Base | Representation |
---|---|
bin | 11111011001011100100010… |
… | …100110010100000100001001 |
3 | 200002221002110022011121011000 |
4 | 133121130202212110010021 |
5 | 121044413333421041242 |
6 | 1205404441353325213 |
7 | 41041351126330050 |
oct | 3731344246240411 |
9 | 602832408147130 |
10 | 138088074002697 |
11 | 3aaa990690a245 |
12 | 135a2488706809 |
13 | 5c08859c64930 |
14 | 26156d9a25397 |
15 | 10e6ec3744a4c |
hex | 7d9722994109 |
138088074002697 has 1024 divisors, whose sum is σ = 290308174643200. Its totient is φ = 62854589952000.
The previous prime is 138088074002677. The next prime is 138088074002713. The reversal of 138088074002697 is 796200470880831.
138088074002697 is a `hidden beast` number, since 1 + 380 + 8 + 80 + 74 + 0 + 0 + 26 + 97 = 666.
It is not a de Polignac number, because 138088074002697 - 216 = 138088073937161 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is not an unprimeable number, because it can be changed into a prime (138088074002647) by changing a digit.
It is a polite number, since it can be written in 1023 ways as a sum of consecutive naturals, for example, 218840053572 + ... + 218840054202.
It is an arithmetic number, because the mean of its divisors is an integer number (283504076800).
Almost surely, 2138088074002697 is an apocalyptic number.
It is an amenable number.
138088074002697 is an abundant number, since it is smaller than the sum of its proper divisors (152220100640503).
138088074002697 is a wasteful number, since it uses less digits than its factorization.
138088074002697 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 875 (or 869 counting only the distinct ones).
The product of its (nonzero) digits is 32514048, while the sum is 63.
The spelling of 138088074002697 in words is "one hundred thirty-eight trillion, eighty-eight billion, seventy-four million, two thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •