Base | Representation |
---|---|
bin | 1000000101100011111… |
… | …1000001110011111000 |
3 | 111021121101211022011200 |
4 | 2001120333001303320 |
5 | 4234013024332333 |
6 | 143454024054200 |
7 | 13015601263332 |
oct | 2013077016370 |
9 | 437541738150 |
10 | 138931870968 |
11 | 53a14467a80 |
12 | 22b14004360 |
13 | 101414bca97 |
14 | 6a1d828452 |
15 | 3932083c13 |
hex | 2058fc1cf8 |
138931870968 has 192 divisors, whose sum is σ = 418979433600. Its totient is φ = 41231773440.
The previous prime is 138931870963. The next prime is 138931870969. The reversal of 138931870968 is 869078139831.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138931870963) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 25980471 + ... + 25985817.
It is an arithmetic number, because the mean of its divisors is an integer number (2182184550).
Almost surely, 2138931870968 is an apocalyptic number.
138931870968 is a gapful number since it is divisible by the number (18) 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 138931870968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (209489716800).
138931870968 is an abundant number, since it is smaller than the sum of its proper divisors (280047562632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138931870968 is a wasteful number, since it uses less digits than its factorization.
138931870968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6042 (or 6035 counting only the distinct ones).
The product of its (nonzero) digits is 15676416, while the sum is 63.
The spelling of 138931870968 in words is "one hundred thirty-eight billion, nine hundred thirty-one million, eight hundred seventy thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •