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

bin | 11101011101001100111… |

… | …01010100111010001101 |

3 | 10120202102200120012020002 |

4 | 32232212131110322031 |

5 | 113040300131121422 |

6 | 2052542410134045 |

7 | 133060013140331 |

oct | 16564635247215 |

9 | 3522380505202 |

10 | 1012110020237 |

11 | 3602627a2388 |

12 | 1441a1721325 |

13 | 745981719a4 |

14 | 36db49037c1 |

15 | 1b4d99ba692 |

hex | eba6754e8d |

1012110020237 has 2 divisors, whose sum is σ = 1012110020238. Its totient is φ = 1012110020236.

The previous prime is 1012110019981. The next prime is 1012110020267. The reversal of 1012110020237 is 7320200112101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 852776524681 + 159333495556 = 923459^2 + 399166^2 .

It is a cyclic number.

It is not a de Polignac number, because 1012110020237 - 2^{8} = 1012110019981 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1012110020267) 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, 506055010118 + 506055010119.

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

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

It is an amenable number.

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

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

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

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

Adding to 1012110020237 its reverse (7320200112101), we get a palindrome (8332310132338).

The spelling of 1012110020237 in words is "one trillion, twelve billion, one hundred ten million, twenty thousand, two hundred thirty-seven".

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