Base | Representation |
---|---|
bin | 11111011110101111010000… |
… | …111100111100101110011100 |
3 | 200011012212020100102222001010 |
4 | 133132233100330330232130 |
5 | 121121343214231043420 |
6 | 1210243511254415220 |
7 | 41106545042033013 |
oct | 3736572074745634 |
9 | 604185210388033 |
10 | 138451776424860 |
11 | 4012a0833a8128 |
12 | 13640a6b961510 |
13 | 5c33c3c5b1962 |
14 | 262915d22ba7a |
15 | 11016ad6ea4e0 |
hex | 7debd0f3cb9c |
138451776424860 has 96 divisors (see below), whose sum is σ = 388798990272000. Its totient is φ = 36812580814080.
The previous prime is 138451776424859. The next prime is 138451776424877. The reversal of 138451776424860 is 68424677154831.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 138451776424791 and 138451776424800.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 39103975 + ... + 42497345.
It is an arithmetic number, because the mean of its divisors is an integer number (4049989482000).
Almost surely, 2138451776424860 is an apocalyptic number.
138451776424860 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
138451776424860 is an abundant number, since it is smaller than the sum of its proper divisors (250347213847140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138451776424860 is a wasteful number, since it uses less digits than its factorization.
138451776424860 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3395371 (or 3395369 counting only the distinct ones).
The product of its (nonzero) digits is 216760320, while the sum is 66.
The spelling of 138451776424860 in words is "one hundred thirty-eight trillion, four hundred fifty-one billion, seven hundred seventy-six million, four hundred twenty-four thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •