Base | Representation |
---|---|
bin | 1100111000010… |
… | …00010000000101 |
3 | 21112021212002000 |
4 | 12130020100011 |
5 | 210124142000 |
6 | 14415335513 |
7 | 2451205020 |
oct | 634102005 |
9 | 245255060 |
10 | 108037125 |
11 | 55a90989 |
12 | 30221599 |
13 | 194c8ac1 |
14 | 104c41b7 |
15 | 9741000 |
hex | 6708405 |
108037125 has 128 divisors (see below), whose sum is σ = 242611200. Its totient is φ = 46310400.
The previous prime is 108037123. The next prime is 108037133. The reversal of 108037125 is 521730801.
It is not a de Polignac number, because 108037125 - 21 = 108037123 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a nialpdrome in base 15.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (108037121) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 401491 + ... + 401759.
It is an arithmetic number, because the mean of its divisors is an integer number (1895400).
Almost surely, 2108037125 is an apocalyptic number.
108037125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
108037125 is an abundant number, since it is smaller than the sum of its proper divisors (134574075).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
108037125 is a wasteful number, since it uses less digits than its factorization.
108037125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317 (or 301 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 27.
The square root of 108037125 is about 10394.0908693353. The cubic root of 108037125 is about 476.2748762504.
Adding to 108037125 its reverse (521730801), we get a palindrome (629767926).
The spelling of 108037125 in words is "one hundred eight million, thirty-seven thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •