Base | Representation |
---|---|
bin | 1000000010010111001… |
… | …1110100010001000000 |
3 | 111012101120021001211120 |
4 | 2000211303310101000 |
5 | 4230233230401023 |
6 | 143232513512240 |
7 | 12655404430215 |
oct | 2004563642100 |
9 | 435346231746 |
10 | 138073293888 |
11 | 53613858342 |
12 | 22914572680 |
13 | 1003566a7ca |
14 | 697b7b1b0c |
15 | 38d19da8e3 |
hex | 2025cf4440 |
138073293888 has 112 divisors (see below), whose sum is σ = 387199388160. Its totient is φ = 43273314304.
The previous prime is 138073293887. The next prime is 138073293889. The reversal of 138073293888 is 888392370831.
It is an interprime number because it is at equal distance from previous prime (138073293887) and next prime (138073293889).
It is not an unprimeable number, because it can be changed into a prime (138073293887) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3285553 + ... + 3327311.
Almost surely, 2138073293888 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 138073293888, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (193599694080).
138073293888 is an abundant number, since it is smaller than the sum of its proper divisors (249126094272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138073293888 is a wasteful number, since it uses less digits than its factorization.
138073293888 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42804 (or 42794 counting only the distinct ones).
The product of its (nonzero) digits is 13934592, while the sum is 60.
The spelling of 138073293888 in words is "one hundred thirty-eight billion, seventy-three million, two hundred ninety-three thousand, eight hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •