Base | Representation |
---|---|
bin | 1000000101011011100… |
… | …1100000111010000000 |
3 | 111021111221222010022001 |
4 | 2001112321200322000 |
5 | 4233430044333130 |
6 | 143450333553344 |
7 | 13014664631614 |
oct | 2012671407200 |
9 | 437457863261 |
10 | 138896871040 |
11 | 539a6732014 |
12 | 22b04345854 |
13 | 10137187075 |
14 | 6a18d17344 |
15 | 392de6d6ca |
hex | 2056e60e80 |
138896871040 has 64 divisors (see below), whose sum is σ = 338315515560. Its totient is φ = 54510456832.
The previous prime is 138896871031. The next prime is 138896871049. The reversal of 138896871040 is 40178698831.
It is an interprime number because it is at equal distance from previous prime (138896871031) and next prime (138896871049).
It can be written as a sum of positive squares in 4 ways, for example, as 83400819264 + 55496051776 = 288792^2 + 235576^2 .
It is a tau number, because it is divible by the number of its divisors (64).
It is not an unprimeable number, because it can be changed into a prime (138896871049) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2013499 + ... + 2081338.
Almost surely, 2138896871040 is an apocalyptic number.
138896871040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
138896871040 is an abundant number, since it is smaller than the sum of its proper divisors (199418644520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138896871040 is an equidigital number, since it uses as much as digits as its factorization.
138896871040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4094909 (or 4094897 counting only the distinct ones).
The product of its (nonzero) digits is 2322432, while the sum is 55.
The spelling of 138896871040 in words is "one hundred thirty-eight billion, eight hundred ninety-six million, eight hundred seventy-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •