Base | Representation |
---|---|
bin | 1101011100000… |
… | …00100100100001 |
3 | 21212002222121111 |
4 | 12232000210201 |
5 | 212324134012 |
6 | 15104023321 |
7 | 2536066102 |
oct | 656004441 |
9 | 255088544 |
10 | 112724257 |
11 | 586a2448 |
12 | 31901b41 |
13 | 1a47a359 |
14 | 10d843a9 |
15 | 9d69ba7 |
hex | 6b80921 |
112724257 has 4 divisors (see below), whose sum is σ = 112787136. Its totient is φ = 112661380.
The previous prime is 112724239. The next prime is 112724267. The reversal of 112724257 is 752427211.
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: 752427211 = 419 ⋅1795769.
It is a cyclic number.
It is not a de Polignac number, because 112724257 - 211 = 112722209 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112724267) 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, 28669 + ... + 32362.
It is an arithmetic number, because the mean of its divisors is an integer number (28196784).
Almost surely, 2112724257 is an apocalyptic number.
It is an amenable number.
112724257 is a deficient number, since it is larger than the sum of its proper divisors (62879).
112724257 is an equidigital number, since it uses as much as digits as its factorization.
112724257 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62878.
The product of its digits is 7840, while the sum is 31.
The square root of 112724257 is about 10617.1680310712. The cubic root of 112724257 is about 483.0652464414.
The spelling of 112724257 in words is "one hundred twelve million, seven hundred twenty-four thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •