Base | Representation |
---|---|
bin | 1000000101010011100… |
… | …1010101110000110000 |
3 | 111021102121202001122122 |
4 | 2001110321111300300 |
5 | 4233342444132320 |
6 | 143443133453412 |
7 | 13014106220321 |
oct | 2012471256060 |
9 | 437377661578 |
10 | 138863270960 |
11 | 53989772857 |
12 | 22ab5041268 |
13 | 1013022156b |
14 | 6a1468c448 |
15 | 392b032d25 |
hex | 2054e55c30 |
138863270960 has 160 divisors (see below), whose sum is σ = 344729364480. Its totient is φ = 51899116544.
The previous prime is 138863270957. The next prime is 138863270969. The reversal of 138863270960 is 69072368831.
It is not an unprimeable number, because it can be changed into a prime (138863270969) 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, 56470211 + ... + 56472669.
It is an arithmetic number, because the mean of its divisors is an integer number (2154558528).
Almost surely, 2138863270960 is an apocalyptic number.
138863270960 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 138863270960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (172364682240).
138863270960 is an abundant number, since it is smaller than the sum of its proper divisors (205866093520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138863270960 is a wasteful number, since it uses less digits than its factorization.
138863270960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3195 (or 3189 counting only the distinct ones).
The product of its (nonzero) digits is 2612736, while the sum is 53.
The spelling of 138863270960 in words is "one hundred thirty-eight billion, eight hundred sixty-three million, two hundred seventy thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •