Base | Representation |
---|---|
bin | 1011111011001011011111… |
… | …1000000010111111101111 |
3 | 1201102102121210100002012011 |
4 | 2332302313320002333233 |
5 | 3204303443212012010 |
6 | 43515132024022051 |
7 | 2522155600414141 |
oct | 276626770027757 |
9 | 51372553302164 |
10 | 13111325110255 |
11 | 41a5533238849 |
12 | 1579090301927 |
13 | 741514872718 |
14 | 33483d1c4c91 |
15 | 17b0c7c7ea8a |
hex | becb7e02fef |
13111325110255 has 32 divisors (see below), whose sum is σ = 17009883437760. Its totient is φ = 9668097377280.
The previous prime is 13111325110253. The next prime is 13111325110283. The reversal of 13111325110255 is 55201152311131.
It is not a de Polignac number, because 13111325110255 - 21 = 13111325110253 is a prime.
It is a super-2 number, since 2×131113251102552 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13111325110253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 147378147 + ... + 147467083.
It is an arithmetic number, because the mean of its divisors is an integer number (531558857430).
Almost surely, 213111325110255 is an apocalyptic number.
13111325110255 is a deficient number, since it is larger than the sum of its proper divisors (3898558327505).
13111325110255 is a wasteful number, since it uses less digits than its factorization.
13111325110255 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130939.
The product of its (nonzero) digits is 4500, while the sum is 31.
Adding to 13111325110255 its reverse (55201152311131), we get a palindrome (68312477421386).
The spelling of 13111325110255 in words is "thirteen trillion, one hundred eleven billion, three hundred twenty-five million, one hundred ten thousand, two hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •