Base | Representation |
---|---|
bin | 110010011100011000… |
… | …0111001110010111001 |
3 | 101100121110110200210122 |
4 | 1210320300321302321 |
5 | 3233323042314022 |
6 | 121433045223025 |
7 | 10553301164624 |
oct | 1447060716271 |
9 | 340543420718 |
10 | 108326526137 |
11 | 41a39555465 |
12 | 18bb2401a75 |
13 | a2a48aa39b |
14 | 5358c44dbb |
15 | 2c40233742 |
hex | 1938c39cb9 |
108326526137 has 8 divisors (see below), whose sum is σ = 112137634440. Its totient is φ = 104520465280.
The previous prime is 108326526097. The next prime is 108326526181. The reversal of 108326526137 is 731625623801.
It can be written as a sum of positive squares in 4 ways, for example, as 32513859856 + 75812666281 = 180316^2 + 275341^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 108326526137 - 26 = 108326526073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (108326528137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1218158 + ... + 1304055.
It is an arithmetic number, because the mean of its divisors is an integer number (14017204305).
Almost surely, 2108326526137 is an apocalyptic number.
It is an amenable number.
108326526137 is a deficient number, since it is larger than the sum of its proper divisors (3811108303).
108326526137 is a wasteful number, since it uses less digits than its factorization.
108326526137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2523723.
The product of its (nonzero) digits is 362880, while the sum is 44.
The spelling of 108326526137 in words is "one hundred eight billion, three hundred twenty-six million, five hundred twenty-six thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •