Base | Representation |
---|---|
bin | 10011101110111001110… |
… | …000111110010000101011 |
3 | 11210122011011011111001010 |
4 | 103232321300332100223 |
5 | 134204123004234011 |
6 | 2514541401155003 |
7 | 166653502022634 |
oct | 23567160762053 |
9 | 4718134144033 |
10 | 1356031321131 |
11 | 4830a9369063 |
12 | 19a98418ba63 |
13 | 9ab4757b326 |
14 | 498bcd1c88b |
15 | 2541803d1a6 |
hex | 13bb9c3e42b |
1356031321131 has 16 divisors (see below), whose sum is σ = 1832962413600. Its totient is φ = 891611728128.
The previous prime is 1356031321129. The next prime is 1356031321147. The reversal of 1356031321131 is 1311231306531.
It is not a de Polignac number, because 1356031321131 - 21 = 1356031321129 is a prime.
It is a super-2 number, since 2×13560313211312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1356031321181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6290436 + ... + 6502433.
It is an arithmetic number, because the mean of its divisors is an integer number (114560150850).
Almost surely, 21356031321131 is an apocalyptic number.
1356031321131 is a deficient number, since it is larger than the sum of its proper divisors (476931092469).
1356031321131 is a wasteful number, since it uses less digits than its factorization.
1356031321131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12793358.
The product of its (nonzero) digits is 4860, while the sum is 30.
Adding to 1356031321131 its reverse (1311231306531), we get a palindrome (2667262627662).
The spelling of 1356031321131 in words is "one trillion, three hundred fifty-six billion, thirty-one million, three hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •