Base | Representation |
---|---|
bin | 11101110110110110000111… |
… | …000100000100010101100111 |
3 | 122012221100000001002221120112 |
4 | 131312312013010010111213 |
5 | 114202410043042143421 |
6 | 1143140012141323235 |
7 | 36442000143240152 |
oct | 3566660704042547 |
9 | 565840001087515 |
10 | 131312301131111 |
11 | 38927263758281 |
12 | 12889253b6651b |
13 | 583690a019a19 |
14 | 245d799350c99 |
15 | 102ab033c345b |
hex | 776d87104567 |
131312301131111 has 8 divisors (see below), whose sum is σ = 131471826960000. Its totient is φ = 131152857095520.
The previous prime is 131312301131059. The next prime is 131312301131191. The reversal of 131312301131111 is 111131103213131.
It is a happy number.
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 131312301131111 - 226 = 131312234022247 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 (131312301131191) 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, 17235236 + ... + 23657513.
It is an arithmetic number, because the mean of its divisors is an integer number (16433978370000).
Almost surely, 2131312301131111 is an apocalyptic number.
131312301131111 is a deficient number, since it is larger than the sum of its proper divisors (159525828889).
131312301131111 is a wasteful number, since it uses less digits than its factorization.
131312301131111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40896649.
The product of its (nonzero) digits is 162, while the sum is 23.
Adding to 131312301131111 its reverse (111131103213131), we get a palindrome (242443404344242).
The spelling of 131312301131111 in words is "one hundred thirty-one trillion, three hundred twelve billion, three hundred one million, one hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •