Base | Representation |
---|---|
bin | 11010011111101… |
… | …00011011100101 |
3 | 120111012111200100 |
4 | 31033310123211 |
5 | 423344010400 |
6 | 34015334313 |
7 | 5336046204 |
oct | 1517643345 |
9 | 514174610 |
10 | 222250725 |
11 | 104500294 |
12 | 62521399 |
13 | 37078008 |
14 | 2173523b |
15 | 147a2100 |
hex | d3f46e5 |
222250725 has 72 divisors (see below), whose sum is σ = 422240832. Its totient is φ = 111513600.
The previous prime is 222250723. The next prime is 222250727. The reversal of 222250725 is 527052222.
It is an interprime number because it is at equal distance from previous prime (222250723) and next prime (222250727).
It is not a de Polignac number, because 222250725 - 21 = 222250723 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222250723) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 346405 + ... + 347045.
It is an arithmetic number, because the mean of its divisors is an integer number (5864456).
Almost surely, 2222250725 is an apocalyptic number.
222250725 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
222250725 is a deficient number, since it is larger than the sum of its proper divisors (199990107).
222250725 is a wasteful number, since it uses less digits than its factorization.
222250725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 747 (or 739 counting only the distinct ones).
The product of its (nonzero) digits is 5600, while the sum is 27.
The square root of 222250725 is about 14908.0758315753. The cubic root of 222250725 is about 605.7327596625.
The spelling of 222250725 in words is "two hundred twenty-two million, two hundred fifty thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •