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

bin | 111001010001101110… |

… | …0000010010101101111 |

3 | 102202111011022022100011 |

4 | 1302203130002111233 |

5 | 4003401241320421 |

6 | 132301140514051 |

7 | 11613040161502 |

oct | 1624334022557 |

9 | 382434268304 |

10 | 123001120111 |

11 | 48189a20081 |

12 | 1ba089ab927 |

13 | b7a2ba169c |

14 | 5d4bb61139 |

15 | 32ed6bb4e1 |

hex | 1ca370256f |

123001120111 has 2 divisors, whose sum is σ = 123001120112. Its totient is φ = 123001120110.

The previous prime is 123001120091. The next prime is 123001120141. The reversal of 123001120111 is 111021100321.

It is a happy number.

It is a weak prime.

It is an emirp because it is prime and its reverse (111021100321) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 123001120111 - 2^{17} = 123000989039 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (123001120141) 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 as a sum of consecutive naturals, namely, 61500560055 + 61500560056.

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

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

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

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

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

The product of its (nonzero) digits is 12, while the sum is 13.

Adding to 123001120111 its reverse (111021100321), we get a palindrome (234022220432).

The spelling of 123001120111 in words is "one hundred twenty-three billion, one million, one hundred twenty thousand, one hundred eleven".

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