Base | Representation |
---|---|
bin | 11101110110110110110110… |
… | …101111011100011001011011 |
3 | 122012221102001210021001221110 |
4 | 131312312312233130121123 |
5 | 114202413212330443003 |
6 | 1143140223354111403 |
7 | 36442026025255623 |
oct | 3566666657343133 |
9 | 565842053231843 |
10 | 131313101031003 |
11 | 3892763422a971 |
12 | 12889437a1b563 |
13 | 5836a06966178 |
14 | 245d833691883 |
15 | 102ab4d72aa03 |
hex | 776db6bdc65b |
131313101031003 has 32 divisors (see below), whose sum is σ = 184959116904960. Its totient is φ = 82637590936320.
The previous prime is 131313101030977. The next prime is 131313101031011. The reversal of 131313101031003 is 300130101313131.
It is not a de Polignac number, because 131313101031003 - 28 = 131313101030747 is a prime.
It is a super-2 number, since 2×1313131010310032 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (131313101031403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1199666625 + ... + 1199776077.
It is an arithmetic number, because the mean of its divisors is an integer number (5779972403280).
Almost surely, 2131313101031003 is an apocalyptic number.
131313101031003 is a deficient number, since it is larger than the sum of its proper divisors (53646015873957).
131313101031003 is a wasteful number, since it uses less digits than its factorization.
131313101031003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184659.
The product of its (nonzero) digits is 243, while the sum is 21.
Adding to 131313101031003 its reverse (300130101313131), we get a palindrome (431443202344134).
The spelling of 131313101031003 in words is "one hundred thirty-one trillion, three hundred thirteen billion, one hundred one million, thirty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •