Base | Representation |
---|---|
bin | 111101001101011000… |
… | …0010001110101010101 |
3 | 110120021122122110011122 |
4 | 1322122300101311111 |
5 | 4123200003203401 |
6 | 140215110213325 |
7 | 12332224114460 |
oct | 1723260216525 |
9 | 416248573148 |
10 | 131445366101 |
11 | 50822534075 |
12 | 21584954245 |
13 | c51a47844a |
14 | 650d42a2d7 |
15 | 3644bba21b |
hex | 1e9ac11d55 |
131445366101 has 4 divisors (see below), whose sum is σ = 150223275552. Its totient is φ = 112667456652.
The previous prime is 131445366083. The next prime is 131445366113. The reversal of 131445366101 is 101663544131.
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, and also an emirpimes, since its reverse is a distinct semiprime: 101663544131 = 19 ⋅5350712849.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131445366101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131445366191) 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 3 ways as a sum of consecutive naturals, for example, 9388954715 + ... + 9388954728.
It is an arithmetic number, because the mean of its divisors is an integer number (37555818888).
Almost surely, 2131445366101 is an apocalyptic number.
It is an amenable number.
131445366101 is a deficient number, since it is larger than the sum of its proper divisors (18777909451).
131445366101 is an equidigital number, since it uses as much as digits as its factorization.
131445366101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18777909450.
The product of its (nonzero) digits is 25920, while the sum is 35.
The spelling of 131445366101 in words is "one hundred thirty-one billion, four hundred forty-five million, three hundred sixty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •