Base | Representation |
---|---|
bin | 1110100100010… |
… | …10100000010101 |
3 | 22111221111210221 |
4 | 13102022200111 |
5 | 222240432013 |
6 | 20043114341 |
7 | 3012462304 |
oct | 722124025 |
9 | 274844727 |
10 | 122202133 |
11 | 62a862a9 |
12 | 34b129b1 |
13 | 1c418371 |
14 | 1233043b |
15 | aadd08d |
hex | 748a815 |
122202133 has 2 divisors, whose sum is σ = 122202134. Its totient is φ = 122202132.
The previous prime is 122202131. The next prime is 122202139. The reversal of 122202133 is 331202221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 116165284 + 6036849 = 10778^2 + 2457^2 .
It is a cyclic number.
It is not a de Polignac number, because 122202133 - 21 = 122202131 is a prime.
It is a super-2 number, since 2×1222021332 = 29866722619499378, which contains 22 as substring.
Together with 122202131, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122202131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61101066 + 61101067.
It is an arithmetic number, because the mean of its divisors is an integer number (61101067).
Almost surely, 2122202133 is an apocalyptic number.
It is an amenable number.
122202133 is a deficient number, since it is larger than the sum of its proper divisors (1).
122202133 is an equidigital number, since it uses as much as digits as its factorization.
122202133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 122202133 is about 11054.5073612531. The cubic root of 122202133 is about 496.2413262109.
Adding to 122202133 its reverse (331202221), we get a palindrome (453404354).
The spelling of 122202133 in words is "one hundred twenty-two million, two hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •