Base | Representation |
---|---|
bin | 1110111100000… |
… | …10010011001101 |
3 | 22201210121211122 |
4 | 13132002103031 |
5 | 224040024003 |
6 | 20233530325 |
7 | 3051103451 |
oct | 736022315 |
9 | 281717748 |
10 | 125314253 |
11 | 648114a9 |
12 | 35b739a5 |
13 | 1cc67a5c |
14 | 12900661 |
15 | b005238 |
hex | 77824cd |
125314253 has 4 divisors (see below), whose sum is σ = 131909760. Its totient is φ = 118718748.
The previous prime is 125314243. The next prime is 125314297. The reversal of 125314253 is 352413521.
It is a happy number.
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, and also an emirpimes, since its reverse is a distinct semiprime: 352413521 = 23 ⋅15322327.
It is a cyclic number.
It is not a de Polignac number, because 125314253 - 210 = 125313229 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125314223) 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, 3297725 + ... + 3297762.
It is an arithmetic number, because the mean of its divisors is an integer number (32977440).
Almost surely, 2125314253 is an apocalyptic number.
It is an amenable number.
125314253 is a deficient number, since it is larger than the sum of its proper divisors (6595507).
125314253 is an equidigital number, since it uses as much as digits as its factorization.
125314253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6595506.
The product of its digits is 3600, while the sum is 26.
The square root of 125314253 is about 11194.3848870762. The cubic root of 125314253 is about 500.4186533609.
Adding to 125314253 its reverse (352413521), we get a palindrome (477727774).
The spelling of 125314253 in words is "one hundred twenty-five million, three hundred fourteen thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •