Base | Representation |
---|---|
bin | 1110111100000… |
… | …10000000100101 |
3 | 22201210120012111 |
4 | 13132002000211 |
5 | 224040004221 |
6 | 20233521021 |
7 | 3051100126 |
oct | 736020045 |
9 | 281716174 |
10 | 125313061 |
11 | 64810615 |
12 | 35b73171 |
13 | 1cc67353 |
14 | 1290004d |
15 | b004be1 |
hex | 7782025 |
125313061 has 4 divisors (see below), whose sum is σ = 125351532. Its totient is φ = 125274592.
The previous prime is 125313053. The next prime is 125313073. The reversal of 125313061 is 160313521.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 68973025 + 56340036 = 8305^2 + 7506^2 .
It is a cyclic number.
It is not a de Polignac number, because 125313061 - 23 = 125313053 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125313091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13846 + ... + 21031.
It is an arithmetic number, because the mean of its divisors is an integer number (31337883).
Almost surely, 2125313061 is an apocalyptic number.
It is an amenable number.
125313061 is a deficient number, since it is larger than the sum of its proper divisors (38471).
125313061 is an equidigital number, since it uses as much as digits as its factorization.
125313061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38470.
The product of its (nonzero) digits is 540, while the sum is 22.
The square root of 125313061 is about 11194.3316459715. The cubic root of 125313061 is about 500.4170666807.
Adding to 125313061 its reverse (160313521), we get a palindrome (285626582).
The spelling of 125313061 in words is "one hundred twenty-five million, three hundred thirteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •