Base | Representation |
---|---|
bin | 1101111101110… |
… | …01100101111101 |
3 | 22011102221111121 |
4 | 12332321211331 |
5 | 214442332000 |
6 | 15342550541 |
7 | 2621530246 |
oct | 676714575 |
9 | 264387447 |
10 | 117152125 |
11 | 60147142 |
12 | 33298451 |
13 | 1b36a8ac |
14 | 117b7ccd |
15 | a441b1a |
hex | 6fb997d |
117152125 has 16 divisors (see below), whose sum is σ = 147294576. Its totient is φ = 93024000.
The previous prime is 117152107. The next prime is 117152137. The reversal of 117152125 is 521251711.
It can be written as a sum of positive squares in 8 ways, for example, as 19971961 + 97180164 = 4469^2 + 9858^2 .
It is not a de Polignac number, because 117152125 - 27 = 117151997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 117152125.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13705 + ... + 20545.
It is an arithmetic number, because the mean of its divisors is an integer number (9205911).
Almost surely, 2117152125 is an apocalyptic number.
117152125 is the 7654-th centered square number.
It is an amenable number.
117152125 is a deficient number, since it is larger than the sum of its proper divisors (30142451).
117152125 is an equidigital number, since it uses as much as digits as its factorization.
117152125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6993 (or 6983 counting only the distinct ones).
The product of its digits is 700, while the sum is 25.
The square root of 117152125 is about 10823.6835227200. The cubic root of 117152125 is about 489.3092098554.
The spelling of 117152125 in words is "one hundred seventeen million, one hundred fifty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •