Base | Representation |
---|---|
bin | 1000000010001011011… |
… | …1100011111000000000 |
3 | 111012021010101211002002 |
4 | 2000202313203320000 |
5 | 4230133112144210 |
6 | 143223552043132 |
7 | 12654235110110 |
oct | 2004267437000 |
9 | 435233354062 |
10 | 138023943680 |
11 | 53598a10847 |
12 | 228bbb334a8 |
13 | 1002837c0bc |
14 | 6975007040 |
15 | 38cc4dd4a5 |
hex | 2022de3e00 |
138023943680 has 320 divisors, whose sum is σ = 392052621312. Its totient is φ = 45603717120.
The previous prime is 138023943679. The next prime is 138023943683. The reversal of 138023943680 is 86349320831.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (320).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138023943683) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 203875502 + ... + 203876178.
Almost surely, 2138023943680 is an apocalyptic number.
138023943680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 138023943680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (196026310656).
138023943680 is an abundant number, since it is smaller than the sum of its proper divisors (254028677632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138023943680 is an equidigital number, since it uses as much as digits as its factorization.
138023943680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1105 (or 1089 counting only the distinct ones).
The product of its (nonzero) digits is 746496, while the sum is 47.
The spelling of 138023943680 in words is "one hundred thirty-eight billion, twenty-three million, nine hundred forty-three thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •