Base | Representation |
---|---|
bin | 1110111010100… |
… | …01111100010101 |
3 | 22201102120010122 |
4 | 13131101330111 |
5 | 224012204211 |
6 | 20225401325 |
7 | 3046320131 |
oct | 735217425 |
9 | 281376118 |
10 | 125116181 |
11 | 64696703 |
12 | 35a99245 |
13 | 1cbc8858 |
14 | 1288c3c1 |
15 | aeb66db |
hex | 7751f15 |
125116181 has 2 divisors, whose sum is σ = 125116182. Its totient is φ = 125116180.
The previous prime is 125116177. The next prime is 125116183. The reversal of 125116181 is 181611521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 124523281 + 592900 = 11159^2 + 770^2 .
It is a cyclic number.
It is not a de Polignac number, because 125116181 - 22 = 125116177 is a prime.
It is a super-2 number, since 2×1251161812 = 31308117496049522, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 125116183, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 125116181.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (125116183) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62558090 + 62558091.
It is an arithmetic number, because the mean of its divisors is an integer number (62558091).
Almost surely, 2125116181 is an apocalyptic number.
It is an amenable number.
125116181 is a deficient number, since it is larger than the sum of its proper divisors (1).
125116181 is an equidigital number, since it uses as much as digits as its factorization.
125116181 is an evil number, because the sum of its binary digits is even.
The product of its digits is 480, while the sum is 26.
The square root of 125116181 is about 11185.5344530335. The cubic root of 125116181 is about 500.1548600318.
The spelling of 125116181 in words is "one hundred twenty-five million, one hundred sixteen thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •