10908 has 24 divisors (see below), whose sum is σ = 28560. Its totient is φ = 3600.
The previous prime is 10903. The next prime is 10909. The reversal of 10908 is 80901.
Added to its reverse (80901) it gives a square (91809 = 3032).
10908 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a zygodrome in base 3.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10903) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 58 + ... + 158.
It is an arithmetic number, because the mean of its divisors is an integer number (1190).
210908 is an apocalyptic number.
10908 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10908, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14280).
10908 is an abundant number, since it is smaller than the sum of its proper divisors (17652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10908 is a wasteful number, since it uses less digits than its factorization.
10908 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114 (or 106 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
The square root of 10908 is about 104.4413711132. The cubic root of 10908 is about 22.1776253751.
10908 divided by its sum of digits (18) gives a palindrome (606).
Adding to 10908 its reverse (80901), we get a square (91809 = 3032).
The spelling of 10908 in words is "ten thousand, nine hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •