Base | Representation |
---|---|
bin | 111101000100000010… |
… | …0111011011001000101 |
3 | 110112110211000102021221 |
4 | 1322020010323121011 |
5 | 4122024243341401 |
6 | 140124034040341 |
7 | 12321400466116 |
oct | 1721004733105 |
9 | 415424012257 |
10 | 131132012101 |
11 | 50681669622 |
12 | 214b7a190b1 |
13 | c49a58328c |
14 | 64bd97c20d |
15 | 362741e7a1 |
hex | 1e8813b645 |
131132012101 has 4 divisors (see below), whose sum is σ = 131179406272. Its totient is φ = 131084617932.
The previous prime is 131132012087. The next prime is 131132012161. The reversal of 131132012101 is 101210231131.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 131132012101 - 25 = 131132012069 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 (131132012161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23692935 + ... + 23698468.
It is an arithmetic number, because the mean of its divisors is an integer number (32794851568).
Almost surely, 2131132012101 is an apocalyptic number.
It is an amenable number.
131132012101 is a deficient number, since it is larger than the sum of its proper divisors (47394171).
131132012101 is an equidigital number, since it uses as much as digits as its factorization.
131132012101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47394170.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 131132012101 its reverse (101210231131), we get a palindrome (232342243232).
The spelling of 131132012101 in words is "one hundred thirty-one billion, one hundred thirty-two million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •