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

bin | 11101000110110001001… |

… | …110010001001011000111 |

3 | 21002012200201022001011021 |

4 | 131012301032101023013 |

5 | 230232233033201411 |

6 | 4130503133452011 |

7 | 264335106560260 |

oct | 35066116211307 |

9 | 7065621261137 |

10 | 2000133100231 |

11 | 701284a9aa82 |

12 | 283780641007 |

13 | 1167c4cc6cc6 |

14 | 6cb42419967 |

15 | 37064a1ea71 |

hex | 1d1b13912c7 |

2000133100231 has 8 divisors (see below), whose sum is σ = 2286494932640. Its totient is φ = 1713928400928.

The previous prime is 2000133100181. The next prime is 2000133100241. The reversal of 2000133100231 is 1320013310002.

Adding to 2000133100231 its reverse (1320013310002), we get a palindrome (3320146410233).

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 2000133100231 - 2^{23} = 2000124711623 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (2000133100241) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39255996 + ... + 39306913.

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

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

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

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

2000133100231 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 78566553.

The product of its (nonzero) digits is 108, while the sum is 16.

The spelling of 2000133100231 in words is "two trillion, one hundred thirty-three million, one hundred thousand, two hundred thirty-one".

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