Base | Representation |
---|---|
bin | 11010011111101… |
… | …11101101000111 |
3 | 120111020012002000 |
4 | 31033313231013 |
5 | 423344423020 |
6 | 34015520343 |
7 | 5336133252 |
oct | 1517675507 |
9 | 514205060 |
10 | 222264135 |
11 | 10450a375 |
12 | 625290b3 |
13 | 37081152 |
14 | 2173a099 |
15 | 147a6090 |
hex | d3f7b47 |
222264135 has 32 divisors (see below), whose sum is σ = 399072960. Its totient is φ = 117360000.
The previous prime is 222264127. The next prime is 222264167. The reversal of 222264135 is 531462222.
It is a happy number.
222264135 is a `hidden beast` number, since 22 + 226 + 413 + 5 = 666.
It is not a de Polignac number, because 222264135 - 23 = 222264127 is a prime.
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 222264099 and 222264108.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5485 + ... + 21785.
It is an arithmetic number, because the mean of its divisors is an integer number (12471030).
Almost surely, 2222264135 is an apocalyptic number.
222264135 is a deficient number, since it is larger than the sum of its proper divisors (176808825).
222264135 is a wasteful number, since it uses less digits than its factorization.
222264135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16416 (or 16410 counting only the distinct ones).
The product of its digits is 5760, while the sum is 27.
The square root of 222264135 is about 14908.5255810224. The cubic root of 222264135 is about 605.7449421694.
The spelling of 222264135 in words is "two hundred twenty-two million, two hundred sixty-four thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •