Base | Representation |
---|---|
bin | 111101000011000111… |
… | …1011110000010010101 |
3 | 110112101200002001212021 |
4 | 1322012033132002111 |
5 | 4121443403033023 |
6 | 140121014053141 |
7 | 12320544664150 |
oct | 1720617360225 |
9 | 415350061767 |
10 | 131101221013 |
11 | 50666248844 |
12 | 214a964a1b1 |
13 | c4940921b9 |
14 | 64b9844c97 |
15 | 362488b35d |
hex | 1e863de095 |
131101221013 has 8 divisors (see below), whose sum is σ = 149967813632. Its totient is φ = 112269090096.
The previous prime is 131101220951. The next prime is 131101221019. The reversal of 131101221013 is 310122101131.
It is a happy number.
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 131101221013 - 29 = 131101220501 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131101221019) 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 in 7 ways as a sum of consecutive naturals, for example, 8607270 + ... + 8622487.
It is an arithmetic number, because the mean of its divisors is an integer number (18745976704).
Almost surely, 2131101221013 is an apocalyptic number.
It is an amenable number.
131101221013 is a deficient number, since it is larger than the sum of its proper divisors (18866592619).
131101221013 is a wasteful number, since it uses less digits than its factorization.
131101221013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17230851.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 131101221013 its reverse (310122101131), we get a palindrome (441223322144).
The spelling of 131101221013 in words is "one hundred thirty-one billion, one hundred one million, two hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •