Base | Representation |
---|---|
bin | 11101110010011110100010… |
… | …111011110111000101011011 |
3 | 122011212122011222021212221001 |
4 | 131302132202323313011123 |
5 | 114133000310440443003 |
6 | 1142350045412125431 |
7 | 36411212330421352 |
oct | 3562364273670533 |
9 | 564778158255831 |
10 | 131012121031003 |
11 | 38820a23930113 |
12 | 1283b03a306877 |
13 | 581450bab0804 |
14 | 244d04032a999 |
15 | 1022dd4edb61d |
hex | 7727a2ef715b |
131012121031003 has 8 divisors (see below), whose sum is σ = 141118245374976. Its totient is φ = 121273492117800.
The previous prime is 131012121030829. The next prime is 131012121031019. The reversal of 131012121031003 is 300130121210131.
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 131012121031003 - 241 = 128813097775451 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131012121041003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91873856953 + ... + 91873858378.
It is an arithmetic number, because the mean of its divisors is an integer number (17639780671872).
Almost surely, 2131012121031003 is an apocalyptic number.
131012121031003 is a deficient number, since it is larger than the sum of its proper divisors (10106124343973).
131012121031003 is a wasteful number, since it uses less digits than its factorization.
131012121031003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183747715385.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 131012121031003 its reverse (300130121210131), we get a palindrome (431142242241134).
The spelling of 131012121031003 in words is "one hundred thirty-one trillion, twelve billion, one hundred twenty-one million, thirty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •