Base | Representation |
---|---|
bin | 1011111011001011000111… |
… | …0010111101001010001011 |
3 | 1201102102100200102001100021 |
4 | 2332302301302331022023 |
5 | 3204303241104043311 |
6 | 43515113541521311 |
7 | 2522153221431121 |
oct | 276626162751213 |
9 | 51372320361307 |
10 | 13111223112331 |
11 | 41a5490702243 |
12 | 1579062113237 |
13 | 7414c96ac716 |
14 | 33482d833911 |
15 | 17b0bdd33171 |
hex | becb1cbd28b |
13111223112331 has 16 divisors (see below), whose sum is σ = 13714024310784. Its totient is φ = 12511176822144.
The previous prime is 13111223112311. The next prime is 13111223112343. The reversal of 13111223112331 is 13321132211131.
It is a cyclic number.
It is not a de Polignac number, because 13111223112331 - 235 = 13076863373963 is a prime.
It is a super-2 number, since 2×131112231123312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13111223112296 and 13111223112305.
It is not an unprimeable number, because it can be changed into a prime (13111223112311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22063206 + ... + 22649668.
It is an arithmetic number, because the mean of its divisors is an integer number (857126519424).
Almost surely, 213111223112331 is an apocalyptic number.
13111223112331 is a deficient number, since it is larger than the sum of its proper divisors (602801198453).
13111223112331 is a wasteful number, since it uses less digits than its factorization.
13111223112331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 588810.
The product of its digits is 648, while the sum is 25.
Adding to 13111223112331 its reverse (13321132211131), we get a palindrome (26432355323462).
The spelling of 13111223112331 in words is "thirteen trillion, one hundred eleven billion, two hundred twenty-three million, one hundred twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •