Base | Representation |
---|---|

bin | 111000111010101111… |

… | …1010010110011001111 |

3 | 102200111102201121222102 |

4 | 1301311133102303033 |

5 | 4000311414101111 |

6 | 132052441505315 |

7 | 11554656513311 |

oct | 1616537226317 |

9 | 380442647872 |

10 | 122230222031 |

11 | 47923856a25 |

12 | 1b8327a223b |

13 | b6ac26aa88 |

14 | 5cb760d7b1 |

15 | 32a5b9213b |

hex | 1c757d2ccf |

122230222031 has 2 divisors, whose sum is σ = 122230222032. Its totient is φ = 122230222030.

The previous prime is 122230222027. The next prime is 122230222043. The reversal of 122230222031 is 130222032221.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 122230222031 - 2^{2} = 122230222027 is a prime.

It is a super-2 number, since 2×122230222031^{2} (a number of 23 digits) contains 22 as substring.

It is a junction number, because it is equal to *n*+sod(*n*) for *n* = 122230221994 and 122230222012.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (122230222021) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61115111015 + 61115111016.

It is an arithmetic number, because the mean of its divisors is an integer number (61115111016).

Almost surely, 2^{122230222031} is an apocalyptic number.

122230222031 is a deficient number, since it is larger than the sum of its proper divisors (1).

122230222031 is an equidigital number, since it uses as much as digits as its factorization.

122230222031 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 576, while the sum is 20.

Adding to 122230222031 its reverse (130222032221), we get a palindrome (252452254252).

The spelling of 122230222031 in words is "one hundred twenty-two billion, two hundred thirty million, two hundred twenty-two thousand, thirty-one".

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •