Base | Representation |
---|---|
bin | 10011000101011100110… |
… | …100010110000101111011 |
3 | 11122101021020111110100001 |
4 | 103011130310112011323 |
5 | 132441444144014011 |
6 | 2442301025253431 |
7 | 163516513124311 |
oct | 23053464260573 |
9 | 4571236443301 |
10 | 1311522251131 |
11 | 466239134a94 |
12 | 192222194277 |
13 | 968a3297b11 |
14 | 476999640b1 |
15 | 241b07757c1 |
hex | 1315cd1617b |
1311522251131 has 8 divisors (see below), whose sum is σ = 1314262214784. Its totient is φ = 1308784276800.
The previous prime is 1311522251129. The next prime is 1311522251269.
It is a happy number.
1311522251131 is nontrivially palindromic in base 10.
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 1311522251131 - 21 = 1311522251129 is a prime.
It is a super-2 number, since 2×13115222511312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1311522251131.
It is not an unprimeable number, because it can be changed into a prime (1311522251101) 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, 826281 + ... + 1818181.
It is an arithmetic number, because the mean of its divisors is an integer number (164282776848).
Almost surely, 21311522251131 is an apocalyptic number.
1311522251131 is a deficient number, since it is larger than the sum of its proper divisors (2739963653).
1311522251131 is an equidigital number, since it uses as much as digits as its factorization.
1311522251131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 994661.
The product of its digits is 1800, while the sum is 28.
The spelling of 1311522251131 in words is "one trillion, three hundred eleven billion, five hundred twenty-two million, two hundred fifty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •