Base | Representation |
---|---|
bin | 10000011111000… |
… | …01000000000000 |
3 | 100122012121102202 |
4 | 20033201000000 |
5 | 240400110211 |
6 | 21415532332 |
7 | 3266255300 |
oct | 1017410000 |
9 | 318177382 |
10 | 138285056 |
11 | 71070678 |
12 | 3a38a0a8 |
13 | 228598a0 |
14 | 14519600 |
15 | c21853b |
hex | 83e1000 |
138285056 has 156 divisors (see below), whose sum is σ = 352966572. Its totient is φ = 53673984.
The previous prime is 138285023. The next prime is 138285061. The reversal of 138285056 is 650582831.
It can be written as a sum of positive squares in 2 ways, for example, as 58003456 + 80281600 = 7616^2 + 8960^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2609126 + ... + 2609178.
Almost surely, 2138285056 is an apocalyptic number.
138285056 is a gapful number since it is divisible by the number (16) 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 138285056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (176483286).
138285056 is an abundant number, since it is smaller than the sum of its proper divisors (214681516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138285056 is an equidigital number, since it uses as much as digits as its factorization.
138285056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104 (or 75 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 38.
The square root of 138285056 is about 11759.4666545724. The cubic root of 138285056 is about 517.1204943955.
The spelling of 138285056 in words is "one hundred thirty-eight million, two hundred eighty-five thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •