Base | Representation |
---|---|
bin | 1100111001111… |
… | …00001001010001 |
3 | 21112200122122110 |
4 | 12130330021101 |
5 | 210202442211 |
6 | 14424055533 |
7 | 2453051511 |
oct | 634741121 |
9 | 245618573 |
10 | 108249681 |
11 | 56116651 |
12 | 303045a9 |
13 | 19571787 |
14 | 1053b841 |
15 | 9783ea6 |
hex | 673c251 |
108249681 has 4 divisors (see below), whose sum is σ = 144332912. Its totient is φ = 72166452.
The previous prime is 108249667. The next prime is 108249709. The reversal of 108249681 is 186942801.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 108249681 - 213 = 108241489 is a prime.
It is a super-2 number, since 2×1082496812 = 23435986873203522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (108249611) 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, 18041611 + ... + 18041616.
It is an arithmetic number, because the mean of its divisors is an integer number (36083228).
Almost surely, 2108249681 is an apocalyptic number.
It is an amenable number.
108249681 is a deficient number, since it is larger than the sum of its proper divisors (36083231).
108249681 is an equidigital number, since it uses as much as digits as its factorization.
108249681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36083230.
The product of its (nonzero) digits is 27648, while the sum is 39.
The square root of 108249681 is about 10404.3106931694. The cubic root of 108249681 is about 476.5870182229.
The spelling of 108249681 in words is "one hundred eight million, two hundred forty-nine thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •