Base | Representation |
---|---|
bin | 1100111001000… |
… | …01001100110011 |
3 | 21112111001020211 |
4 | 12130201030303 |
5 | 210140424230 |
6 | 14421444551 |
7 | 2452111654 |
oct | 634411463 |
9 | 245431224 |
10 | 108139315 |
11 | 56050739 |
12 | 30270757 |
13 | 1953347b |
14 | 1050d52b |
15 | 976142a |
hex | 6721333 |
108139315 has 8 divisors (see below), whose sum is σ = 133953408. Its totient is φ = 83720640.
The previous prime is 108139303. The next prime is 108139327. The reversal of 108139315 is 513931801.
It is an interprime number because it is at equal distance from previous prime (108139303) and next prime (108139327).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 108139315 - 213 = 108131123 is a prime.
It is a super-2 number, since 2×1081393152 = 23388222897338450, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 348682 + ... + 348991.
It is an arithmetic number, because the mean of its divisors is an integer number (16744176).
Almost surely, 2108139315 is an apocalyptic number.
108139315 is a deficient number, since it is larger than the sum of its proper divisors (25814093).
108139315 is an equidigital number, since it uses as much as digits as its factorization.
108139315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 697709.
The product of its (nonzero) digits is 3240, while the sum is 31.
The square root of 108139315 is about 10399.0054812948. The cubic root of 108139315 is about 476.4249949933.
The spelling of 108139315 in words is "one hundred eight million, one hundred thirty-nine thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •