Base | Representation |
---|---|
bin | 11101110110101101100011… |
… | …010110011011101100100011 |
3 | 122012220110021122012021222210 |
4 | 131312231203112123230203 |
5 | 114202232233134443021 |
6 | 1143131452243133203 |
7 | 36441223343206644 |
oct | 3566554326335443 |
9 | 565813248167883 |
10 | 131303112031011 |
11 | 38923378749378 |
12 | 1288750a674203 |
13 | 5835aa432a79b |
14 | 245d166b936cb |
15 | 102a7667e1e76 |
hex | 776b6359bb23 |
131303112031011 has 8 divisors (see below), whose sum is σ = 175070913416784. Its totient is φ = 87535359332960.
The previous prime is 131303112030991. The next prime is 131303112031099. The reversal of 131303112031011 is 110130211303131.
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 131303112031011 - 225 = 131303078476579 is a prime.
It is a super-2 number, since 2×1313031120310112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (131303112031411) 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, 5329860 + ... + 17059121.
It is an arithmetic number, because the mean of its divisors is an integer number (21883864177098).
Almost surely, 2131303112031011 is an apocalyptic number.
131303112031011 is a deficient number, since it is larger than the sum of its proper divisors (43767801385773).
131303112031011 is a wasteful number, since it uses less digits than its factorization.
131303112031011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24343861.
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 131303112031011 its reverse (110130211303131), we get a palindrome (241433323334142).
The spelling of 131303112031011 in words is "one hundred thirty-one trillion, three hundred three billion, one hundred twelve million, thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •