Base | Representation |
---|---|
bin | 1110111001110… |
… | …01110000011101 |
3 | 22201020112020121 |
4 | 13130321300131 |
5 | 224001021432 |
6 | 20223314541 |
7 | 3045425251 |
oct | 734716035 |
9 | 281215217 |
10 | 125017117 |
11 | 64629235 |
12 | 35a4ba51 |
13 | 1cb92734 |
14 | 12864261 |
15 | ae97197 |
hex | 7739c1d |
125017117 has 8 divisors (see below), whose sum is σ = 128549592. Its totient is φ = 121492800.
The previous prime is 125017111. The next prime is 125017127. The reversal of 125017117 is 711710521.
It can be written as a sum of positive squares in 4 ways, for example, as 76282756 + 48734361 = 8734^2 + 6981^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 125017117 - 211 = 125015069 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 125017091 and 125017100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125017111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42267 + ... + 45127.
It is an arithmetic number, because the mean of its divisors is an integer number (16068699).
Almost surely, 2125017117 is an apocalyptic number.
It is an amenable number.
125017117 is a deficient number, since it is larger than the sum of its proper divisors (3532475).
125017117 is a wasteful number, since it uses less digits than its factorization.
125017117 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4079.
The product of its (nonzero) digits is 490, while the sum is 25.
The square root of 125017117 is about 11181.1053568062. The cubic root of 125017117 is about 500.0228216250.
Adding to 125017117 its reverse (711710521), we get a palindrome (836727638).
The spelling of 125017117 in words is "one hundred twenty-five million, seventeen thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •