Base | Representation |
---|---|
bin | 11010100101010… |
… | …01111100010001 |
3 | 120112121021112012 |
4 | 31102221330101 |
5 | 424041303233 |
6 | 34043312305 |
7 | 5345263562 |
oct | 1522517421 |
9 | 515537465 |
10 | 222994193 |
11 | 104968924 |
12 | 6281b695 |
13 | 37278536 |
14 | 2188a169 |
15 | 1489c548 |
hex | d4a9f11 |
222994193 has 2 divisors, whose sum is σ = 222994194. Its totient is φ = 222994192.
The previous prime is 222994183. The next prime is 222994199. The reversal of 222994193 is 391499222.
222994193 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 115519504 + 107474689 = 10748^2 + 10367^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-222994193 is a prime.
It is a super-2 number, since 2×2229941932 = 99452820223442498, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 222994193.
It is not a weakly prime, because it can be changed into another prime (222994199) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111497096 + 111497097.
It is an arithmetic number, because the mean of its divisors is an integer number (111497097).
Almost surely, 2222994193 is an apocalyptic number.
It is an amenable number.
222994193 is a deficient number, since it is larger than the sum of its proper divisors (1).
222994193 is an equidigital number, since it uses as much as digits as its factorization.
222994193 is an evil number, because the sum of its binary digits is even.
The product of its digits is 69984, while the sum is 41.
The square root of 222994193 is about 14932.9900890612. The cubic root of 222994193 is about 606.4074356703.
The spelling of 222994193 in words is "two hundred twenty-two million, nine hundred ninety-four thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •