Base | Representation |
---|---|
bin | 111000111010101111… |
… | …1010000011000100101 |
3 | 102200111102201010101211 |
4 | 1301311133100120211 |
5 | 4000311413242013 |
6 | 132052441351421 |
7 | 11554656442411 |
oct | 1616537203045 |
9 | 380442633354 |
10 | 122230212133 |
11 | 4792384a547 |
12 | 1b832798571 |
13 | b6ac266413 |
14 | 5cb7609d41 |
15 | 32a5b8e23d |
hex | 1c757d0625 |
122230212133 has 4 divisors (see below), whose sum is σ = 122232247840. Its totient is φ = 122228176428.
The previous prime is 122230212119. The next prime is 122230212157. The reversal of 122230212133 is 331212032221.
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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122230212133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122230212193) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 924963 + ... + 1048816.
It is an arithmetic number, because the mean of its divisors is an integer number (30558061960).
Almost surely, 2122230212133 is an apocalyptic number.
It is an amenable number.
122230212133 is a deficient number, since it is larger than the sum of its proper divisors (2035707).
122230212133 is an equidigital number, since it uses as much as digits as its factorization.
122230212133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2035706.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 122230212133 its reverse (331212032221), we get a palindrome (453442244354).
The spelling of 122230212133 in words is "one hundred twenty-two billion, two hundred thirty million, two hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •