Base | Representation |
---|---|
bin | 1100111000011… |
… | …11111010111001 |
3 | 21112100110011102 |
4 | 12130033322321 |
5 | 210131143122 |
6 | 14420141145 |
7 | 2451365423 |
oct | 634177271 |
9 | 245313142 |
10 | 108068537 |
11 | 56002545 |
12 | 302377b5 |
13 | 1950a1a5 |
14 | 104d1813 |
15 | 974a492 |
hex | 670feb9 |
108068537 has 8 divisors (see below), whose sum is σ = 110340360. Its totient is φ = 105805440.
The previous prime is 108068533. The next prime is 108068551. The reversal of 108068537 is 735860801.
It can be written as a sum of positive squares in 4 ways, for example, as 37994896 + 70073641 = 6164^2 + 8371^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 108068537 - 22 = 108068533 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 108068537.
It is not an unprimeable number, because it can be changed into a prime (108068531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26789 + ... + 30557.
It is an arithmetic number, because the mean of its divisors is an integer number (13792545).
Almost surely, 2108068537 is an apocalyptic number.
It is an amenable number.
108068537 is a deficient number, since it is larger than the sum of its proper divisors (2271823).
108068537 is an equidigital number, since it uses as much as digits as its factorization.
108068537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4363.
The product of its (nonzero) digits is 40320, while the sum is 38.
The square root of 108068537 is about 10395.6018103812. The cubic root of 108068537 is about 476.3210310534.
The spelling of 108068537 in words is "one hundred eight million, sixty-eight thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •