Base | Representation |
---|---|
bin | 11101110100010110111000… |
… | …000011011000000011000011 |
3 | 122012022222200101010002221010 |
4 | 131310112320003120003003 |
5 | 114142104413012411233 |
6 | 1142525254231332003 |
7 | 36423435161430543 |
oct | 3564267003300303 |
9 | 565288611102833 |
10 | 131141324341443 |
11 | 388707a581a619 |
12 | 12860098221003 |
13 | 582375c8c11b0 |
14 | 24553b9a8d323 |
15 | 1026447e2db63 |
hex | 7745b80d80c3 |
131141324341443 has 32 divisors (see below), whose sum is σ = 190776759747840. Its totient is φ = 79645305029760.
The previous prime is 131141324341411. The next prime is 131141324341451. The reversal of 131141324341443 is 344143423141131.
It is not a de Polignac number, because 131141324341443 - 25 = 131141324341411 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is not an unprimeable number, because it can be changed into a prime (131141324341843) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18480673 + ... + 24572706.
It is an arithmetic number, because the mean of its divisors is an integer number (5961773742120).
Almost surely, 2131141324341443 is an apocalyptic number.
131141324341443 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
131141324341443 is a deficient number, since it is larger than the sum of its proper divisors (59635435406397).
131141324341443 is a wasteful number, since it uses less digits than its factorization.
131141324341443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43054419.
The product of its digits is 165888, while the sum is 39.
Adding to 131141324341443 its reverse (344143423141131), we get a palindrome (475284747482574).
The spelling of 131141324341443 in words is "one hundred thirty-one trillion, one hundred forty-one billion, three hundred twenty-four million, three hundred forty-one thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •