Base | Representation |
---|---|
bin | 1011111011001011011100… |
… | …0010010000111000000011 |
3 | 1201102102120210210210002210 |
4 | 2332302313002100320003 |
5 | 3204303431104330311 |
6 | 43515130401513203 |
7 | 2522155336523331 |
oct | 276626702207003 |
9 | 51372523723083 |
10 | 13111311011331 |
11 | 41a5526289045 |
12 | 1579087642803 |
13 | 741511977270 |
14 | 33483b394b51 |
15 | 17b0c68e73a6 |
hex | becb7090e03 |
13111311011331 has 32 divisors (see below), whose sum is σ = 19337002267968. Its totient is φ = 7849749381120.
The previous prime is 13111311011311. The next prime is 13111311011353. The reversal of 13111311011331 is 13311011311131.
It is not a de Polignac number, because 13111311011331 - 210 = 13111311010307 is a prime.
It is a super-3 number, since 3×131113110113313 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 13111311011298 and 13111311011307.
It is not an unprimeable number, because it can be changed into a prime (13111311011311) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16466755 + ... + 17244611.
It is an arithmetic number, because the mean of its divisors is an integer number (604281320874).
Almost surely, 213111311011331 is an apocalyptic number.
13111311011331 is a deficient number, since it is larger than the sum of its proper divisors (6225691256637).
13111311011331 is a wasteful number, since it uses less digits than its factorization.
13111311011331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 789591.
The product of its (nonzero) digits is 81, while the sum is 21.
Adding to 13111311011331 its reverse (13311011311131), we get a palindrome (26422322322462).
The spelling of 13111311011331 in words is "thirteen trillion, one hundred eleven billion, three hundred eleven million, eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •