Base | Representation |
---|---|
bin | 1110111011100… |
… | …00110011001101 |
3 | 22201122222111211 |
4 | 13131300303031 |
5 | 224030230243 |
6 | 20232214421 |
7 | 3050354461 |
oct | 735606315 |
9 | 281588454 |
10 | 125242573 |
11 | 64772665 |
12 | 35b3a411 |
13 | 1cc41241 |
14 | 128c24a1 |
15 | aeddd9d |
hex | 7770ccd |
125242573 has 4 divisors (see below), whose sum is σ = 129282688. Its totient is φ = 121202460.
The previous prime is 125242549. The next prime is 125242591. The reversal of 125242573 is 375242521.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 125242573 - 217 = 125111501 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31), and also a Moran number because the ratio is a prime number: 4040083 = 125242573 / (1 + 2 + 5 + 2 + 4 + 2 + 5 + 7 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125242673) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2020011 + ... + 2020072.
It is an arithmetic number, because the mean of its divisors is an integer number (32320672).
Almost surely, 2125242573 is an apocalyptic number.
It is an amenable number.
125242573 is a deficient number, since it is larger than the sum of its proper divisors (4040115).
125242573 is an equidigital number, since it uses as much as digits as its factorization.
125242573 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4040114.
The product of its digits is 16800, while the sum is 31.
The square root of 125242573 is about 11191.1828239914. The cubic root of 125242573 is about 500.3232216771.
The spelling of 125242573 in words is "one hundred twenty-five million, two hundred forty-two thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •