Base | Representation |
---|---|
bin | 11101110011110100100001… |
… | …110001011101001011011101 |
3 | 122012012110111001222020220211 |
4 | 131303310201301131023131 |
5 | 114141003344442314401 |
6 | 1142500314431212421 |
7 | 36420661216102663 |
oct | 3563644161351335 |
9 | 565173431866824 |
10 | 131104443323101 |
11 | 3885709a408676 |
12 | 12854b04977111 |
13 | 5820132a81711 |
14 | 24536bb81ac33 |
15 | 10254da18e951 |
hex | 773d21c5d2dd |
131104443323101 has 8 divisors (see below), whose sum is σ = 132138371431424. Its totient is φ = 130070540365920.
The previous prime is 131104443323089. The next prime is 131104443323197. The reversal of 131104443323101 is 101323344401131.
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 131104443323101 - 27 = 131104443322973 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 (131104443327101) 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, 4247986 + ... + 16740796.
It is an arithmetic number, because the mean of its divisors is an integer number (16517296428928).
Almost surely, 2131104443323101 is an apocalyptic number.
It is an amenable number.
131104443323101 is a deficient number, since it is larger than the sum of its proper divisors (1033928108323).
131104443323101 is a wasteful number, since it uses less digits than its factorization.
131104443323101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12575571.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 131104443323101 its reverse (101323344401131), we get a palindrome (232427787724232).
The spelling of 131104443323101 in words is "one hundred thirty-one trillion, one hundred four billion, four hundred forty-three million, three hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •