Base | Representation |
---|---|
bin | 11101110010111010100000… |
… | …011101100101001011110001 |
3 | 122011222111200100101111002021 |
4 | 131302322200131211023301 |
5 | 114133443302420410001 |
6 | 1142411532515151441 |
7 | 36413324332164121 |
oct | 3562724035451361 |
9 | 564874610344067 |
10 | 131042144310001 |
11 | 38832730223a91 |
12 | 12844a18ba5581 |
13 | 58172b4c36662 |
14 | 245068b8b4c81 |
15 | 1023a90bb2ba1 |
hex | 772ea07652f1 |
131042144310001 has 4 divisors (see below), whose sum is σ = 131044319307504. Its totient is φ = 131039969312500.
The previous prime is 131042144309963. The next prime is 131042144310019. The reversal of 131042144310001 is 100013441240131.
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.
It is a cyclic number.
It is not a de Polignac number, because 131042144310001 - 211 = 131042144307953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131042144310101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1087408375 + ... + 1087528876.
It is an arithmetic number, because the mean of its divisors is an integer number (32761079826876).
Almost surely, 2131042144310001 is an apocalyptic number.
It is an amenable number.
131042144310001 is a deficient number, since it is larger than the sum of its proper divisors (2174997503).
131042144310001 is an equidigital number, since it uses as much as digits as its factorization.
131042144310001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2174997502.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 131042144310001 its reverse (100013441240131), we get a palindrome (231055585550132).
The spelling of 131042144310001 in words is "one hundred thirty-one trillion, forty-two billion, one hundred forty-four million, three hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •