Base | Representation |
---|---|
bin | 11110000010010011101110… |
… | …001011000011010000011111 |
3 | 122022201122012211101001201012 |
4 | 132002103232023003100133 |
5 | 114303311310031430421 |
6 | 1144541523513005435 |
7 | 36552624252351404 |
oct | 3602235613032037 |
9 | 568648184331635 |
10 | 132100010030111 |
11 | 39100332904962 |
12 | 12995a4a0b387b |
13 | 5892c9272b466 |
14 | 24899631602ab |
15 | 10413575e295b |
hex | 7824ee2c341f |
132100010030111 has 8 divisors (see below), whose sum is σ = 136698008076000. Its totient is φ = 127504867003360.
The previous prime is 132100010030099. The next prime is 132100010030141. The reversal of 132100010030111 is 111030010001231.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132100010030111 - 230 = 132098936288287 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 (132100010030141) 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 in 7 ways as a sum of consecutive naturals, for example, 713660636 + ... + 713845713.
It is an arithmetic number, because the mean of its divisors is an integer number (17087251009500).
Almost surely, 2132100010030111 is an apocalyptic number.
132100010030111 is a deficient number, since it is larger than the sum of its proper divisors (4597998045889).
132100010030111 is a wasteful number, since it uses less digits than its factorization.
132100010030111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1427509569.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 132100010030111 its reverse (111030010001231), we get a palindrome (243130020031342).
The spelling of 132100010030111 in words is "one hundred thirty-two trillion, one hundred billion, ten million, thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •