Base | Representation |
---|---|
bin | 10000100000000… |
… | …01000000000000 |
3 | 100122110021020021 |
4 | 20100001000000 |
5 | 240413304003 |
6 | 21422423224 |
7 | 3300342364 |
oct | 1020010000 |
9 | 318407207 |
10 | 138416128 |
11 | 711500a4 |
12 | 3a431b14 |
13 | 228a4446 |
14 | 145512a4 |
15 | c2422bd |
hex | 8401000 |
138416128 has 52 divisors (see below), whose sum is σ = 283080960. Its totient is φ = 67641344.
The previous prime is 138416119. The next prime is 138416129. The reversal of 138416128 is 821614831.
Its product of digits (9216) is a multiple of the sum of its prime divisors (768).
It is a junction number, because it is equal to n+sod(n) for n = 138416093 and 138416102.
It is not an unprimeable number, because it can be changed into a prime (138416129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (3) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 192153 + ... + 192871.
Almost surely, 2138416128 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 138416128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (141540480).
138416128 is an abundant number, since it is smaller than the sum of its proper divisors (144664832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138416128 is an frugal number, since it uses more digits than its factorization.
138416128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 790 (or 768 counting only the distinct ones).
The product of its digits is 9216, while the sum is 34.
The square root of 138416128 is about 11765.0383764780. The cubic root of 138416128 is about 517.2838251651.
The spelling of 138416128 in words is "one hundred thirty-eight million, four hundred sixteen thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •