Base | Representation |
---|---|
bin | 1110111100000… |
… | …10110000100011 |
3 | 22201210201102012 |
4 | 13132002300203 |
5 | 224040104011 |
6 | 20233543135 |
7 | 3051112103 |
oct | 736026043 |
9 | 281721365 |
10 | 125316131 |
11 | 64812956 |
12 | 35b74aab |
13 | 1cc68875 |
14 | 12901203 |
15 | b005a8b |
hex | 7782c23 |
125316131 has 4 divisors (see below), whose sum is σ = 128372664. Its totient is φ = 122259600.
The previous prime is 125316119. The next prime is 125316133. The reversal of 125316131 is 131613521.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 125316131 - 26 = 125316067 is a prime.
It is a super-2 number, since 2×1253161312 = 31408265377618322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 125316097 and 125316106.
It is not an unprimeable number, because it can be changed into a prime (125316133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1528205 + ... + 1528286.
It is an arithmetic number, because the mean of its divisors is an integer number (32093166).
Almost surely, 2125316131 is an apocalyptic number.
125316131 is a deficient number, since it is larger than the sum of its proper divisors (3056533).
125316131 is an equidigital number, since it uses as much as digits as its factorization.
125316131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3056532.
The product of its digits is 540, while the sum is 23.
The square root of 125316131 is about 11194.4687681015. The cubic root of 125316131 is about 500.4211531604.
Adding to 125316131 its reverse (131613521), we get a palindrome (256929652).
The spelling of 125316131 in words is "one hundred twenty-five million, three hundred sixteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •