Base | Representation |
---|---|
bin | 11101110111000111111100… |
… | …001010001101010110010101 |
3 | 122020000011102020200220102101 |
4 | 131313013330022031112111 |
5 | 114203213300024404331 |
6 | 1143152455544442101 |
7 | 36443245436124040 |
oct | 3567077412152625 |
9 | 566004366626371 |
10 | 131331445544341 |
11 | 3893439822a299 |
12 | 12890ab7479331 |
13 | 583866b37b4a3 |
14 | 2460693b5bc57 |
15 | 102b373e87061 |
hex | 7771fc28d595 |
131331445544341 has 16 divisors (see below), whose sum is σ = 157993067628160. Its totient is φ = 106644846551040.
The previous prime is 131331445544279. The next prime is 131331445544401. The reversal of 131331445544341 is 143445544133131.
It is a de Polignac number, because none of the positive numbers 2k-131331445544341 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131331445544291 and 131331445544300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131331445544141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 83231965 + ... + 84795181.
It is an arithmetic number, because the mean of its divisors is an integer number (9874566726760).
Almost surely, 2131331445544341 is an apocalyptic number.
It is an amenable number.
131331445544341 is a deficient number, since it is larger than the sum of its proper divisors (26661622083819).
131331445544341 is a wasteful number, since it uses less digits than its factorization.
131331445544341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2194924.
The product of its digits is 2073600, while the sum is 46.
Adding to 131331445544341 its reverse (143445544133131), we get a palindrome (274776989677472).
The spelling of 131331445544341 in words is "one hundred thirty-one trillion, three hundred thirty-one billion, four hundred forty-five million, five hundred forty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •