Base | Representation |
---|---|
bin | 1100111000110… |
… | …01010100010101 |
3 | 21112102101222001 |
4 | 12130121110111 |
5 | 210133411104 |
6 | 14421035301 |
7 | 2451615562 |
oct | 634312425 |
9 | 245371861 |
10 | 108107029 |
11 | 56029458 |
12 | 30255b31 |
13 | 19521874 |
14 | 10501869 |
15 | 9756aa4 |
hex | 6719515 |
108107029 has 4 divisors (see below), whose sum is σ = 114466284. Its totient is φ = 101747776.
The previous prime is 108107023. The next prime is 108107033. The reversal of 108107029 is 920701801.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 68856804 + 39250225 = 8298^2 + 6265^2 .
It is a cyclic number.
It is not a de Polignac number, because 108107029 - 211 = 108104981 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 108106988 and 108107006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (108107023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3179602 + ... + 3179635.
It is an arithmetic number, because the mean of its divisors is an integer number (28616571).
Almost surely, 2108107029 is an apocalyptic number.
It is an amenable number.
108107029 is a deficient number, since it is larger than the sum of its proper divisors (6359255).
108107029 is an equidigital number, since it uses as much as digits as its factorization.
108107029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6359254.
The product of its (nonzero) digits is 1008, while the sum is 28.
The square root of 108107029 is about 10397.4530054240. The cubic root of 108107029 is about 476.3775765669.
The spelling of 108107029 in words is "one hundred eight million, one hundred seven thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •