Base | Representation |
---|---|
bin | 1100111011101… |
… | …11011110001001 |
3 | 21120010222222110 |
4 | 12131313132021 |
5 | 210233231211 |
6 | 14433212533 |
7 | 2455113123 |
oct | 635673611 |
9 | 246128873 |
10 | 108492681 |
11 | 56272180 |
12 | 30401149 |
13 | 1962826b |
14 | 105a2213 |
15 | 97d0ea6 |
hex | 6777789 |
108492681 has 32 divisors (see below), whose sum is σ = 162339840. Its totient is φ = 63892800.
The previous prime is 108492647. The next prime is 108492707. The reversal of 108492681 is 186294801.
It is not a de Polignac number, because 108492681 - 26 = 108492617 is a prime.
It is a super-2 number, since 2×1084926812 = 23541323661135522, which contains 22 as substring.
It is a plaindrome in base 16.
It is not an unprimeable number, because it can be changed into a prime (108492581) 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 31 ways as a sum of consecutive naturals, for example, 200271 + ... + 200811.
It is an arithmetic number, because the mean of its divisors is an integer number (5073120).
Almost surely, 2108492681 is an apocalyptic number.
108492681 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
108492681 is a deficient number, since it is larger than the sum of its proper divisors (53847159).
108492681 is a wasteful number, since it uses less digits than its factorization.
108492681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 717.
The product of its (nonzero) digits is 27648, while the sum is 39.
The square root of 108492681 is about 10415.9819988324. The cubic root of 108492681 is about 476.9433675277.
It can be divided in two parts, 10849 and 2681, that added together give a triangular number (13530 = T164).
The spelling of 108492681 in words is "one hundred eight million, four hundred ninety-two thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •