Base | Representation |
---|---|
bin | 11111100011001111101011… |
… | …011001111001011100000111 |
3 | 200012022110120120201011222221 |
4 | 133203033223121321130013 |
5 | 121141431431203212003 |
6 | 1211042044514433211 |
7 | 41141120165614633 |
oct | 3743175331713407 |
9 | 605273516634887 |
10 | 138761457866503 |
11 | 4023944950986a |
12 | 13690a97592807 |
13 | 5c571c3102a54 |
14 | 263a13a08bdc3 |
15 | 1109785cde7bd |
hex | 7e33eb679707 |
138761457866503 has 8 divisors (see below), whose sum is σ = 144925127935200. Its totient is φ = 132608668064928.
The previous prime is 138761457866501. The next prime is 138761457866569. The reversal of 138761457866503 is 305668754167831.
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 138761457866503 - 21 = 138761457866501 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 (138761457866501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2720040708 + ... + 2720091721.
It is an arithmetic number, because the mean of its divisors is an integer number (18115640991900).
Almost surely, 2138761457866503 is an apocalyptic number.
138761457866503 is a deficient number, since it is larger than the sum of its proper divisors (6163670068697).
138761457866503 is a wasteful number, since it uses less digits than its factorization.
138761457866503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5440133561.
The product of its (nonzero) digits is 609638400, while the sum is 70.
The spelling of 138761457866503 in words is "one hundred thirty-eight trillion, seven hundred sixty-one billion, four hundred fifty-seven million, eight hundred sixty-six thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •