Base | Representation |
---|---|
bin | 11101111000101110010110… |
… | …101000010110100101001101 |
3 | 122020101200020221201010000111 |
4 | 131320232112220112211031 |
5 | 114212014002244221031 |
6 | 1143315203433000021 |
7 | 36454220463603346 |
oct | 3570562650264515 |
9 | 566350227633014 |
10 | 131441411320141 |
11 | 38976a9802423a |
12 | 128aa286853011 |
13 | 5845b44754790 |
14 | 2465b265930cd |
15 | 102e15d06e1b1 |
hex | 778b96a1694d |
131441411320141 has 8 divisors (see below), whose sum is σ = 141552478247040. Its totient is φ = 121330371412272.
The previous prime is 131441411320081. The next prime is 131441411320151. The reversal of 131441411320141 is 141023114144131.
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 131441411320141 - 29 = 131441411319629 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 (131441411320151) 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, 3980976 + ... + 16695238.
It is an arithmetic number, because the mean of its divisors is an integer number (17694059780880).
Almost surely, 2131441411320141 is an apocalyptic number.
It is an amenable number.
131441411320141 is a deficient number, since it is larger than the sum of its proper divisors (10111066926899).
131441411320141 is a wasteful number, since it uses less digits than its factorization.
131441411320141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13509515.
The product of its (nonzero) digits is 4608, while the sum is 31.
Adding to 131441411320141 its reverse (141023114144131), we get a palindrome (272464525464272).
The spelling of 131441411320141 in words is "one hundred thirty-one trillion, four hundred forty-one billion, four hundred eleven million, three hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •