Base | Representation |
---|---|
bin | 10000011101100111010… |
… | …101101010100001101111 |
3 | 11000011002221121020101202 |
4 | 100131213111222201233 |
5 | 122013410343200221 |
6 | 2223414450200115 |
7 | 144506630311133 |
oct | 20354725524157 |
9 | 4004087536352 |
10 | 1131310131311 |
11 | 3a6871092078 |
12 | 16330958303b |
13 | 828b37148a9 |
14 | 3ca8190d3c3 |
15 | 1e66461bd0b |
hex | 1076756a86f |
1131310131311 has 8 divisors (see below), whose sum is σ = 1213020544320. Its totient is φ = 1051284469248.
The previous prime is 1131310131283. The next prime is 1131310131317.
It is a happy number.
1131310131311 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 1131310131311 - 26 = 1131310131247 is a prime.
It is a super-2 number, since 2×11313101313112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1131310131317) 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, 421186346 + ... + 421189031.
It is an arithmetic number, because the mean of its divisors is an integer number (151627568040).
Almost surely, 21131310131311 is an apocalyptic number.
1131310131311 is a deficient number, since it is larger than the sum of its proper divisors (81710413009).
1131310131311 is an equidigital number, since it uses as much as digits as its factorization.
1131310131311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 842375473.
The product of its (nonzero) digits is 81, while the sum is 20.
It can be divided in two parts, 1131310 and 131311, that added together give a palindrome (1262621).
The spelling of 1131310131311 in words is "one trillion, one hundred thirty-one billion, three hundred ten million, one hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •