Base | Representation |
---|---|
bin | 1000000011010111011… |
… | …1010010111001100000 |
3 | 111020002100002022221201 |
4 | 2000311313102321200 |
5 | 4231311204004443 |
6 | 143315334530544 |
7 | 12665155022410 |
oct | 2006567227140 |
9 | 436070068851 |
10 | 138342641248 |
11 | 537418a5a69 |
12 | 2298a806a54 |
13 | 100793c5546 |
14 | 69a5486640 |
15 | 38ea49234d |
hex | 2035dd2e60 |
138342641248 has 144 divisors (see below), whose sum is σ = 321660460800. Its totient is φ = 57372074496.
The previous prime is 138342641219. The next prime is 138342641251. The reversal of 138342641248 is 842146243831.
It is a junction number, because it is equal to n+sod(n) for n = 138342641198 and 138342641207.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 61023411 + ... + 61025677.
It is an arithmetic number, because the mean of its divisors is an integer number (2233753200).
Almost surely, 2138342641248 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 138342641248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (160830230400).
138342641248 is an abundant number, since it is smaller than the sum of its proper divisors (183317819552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138342641248 is a wasteful number, since it uses less digits than its factorization.
138342641248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2557 (or 2512 counting only the distinct ones).
The product of its digits is 884736, while the sum is 46.
The spelling of 138342641248 in words is "one hundred thirty-eight billion, three hundred forty-two million, six hundred forty-one thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •