Base | Representation |
---|---|
bin | 1011111011001100001101… |
… | …1111101101000000100101 |
3 | 1201102110010101011022120020 |
4 | 2332303003133231000211 |
5 | 3204304343113232313 |
6 | 43515203230225353 |
7 | 2522163455416140 |
oct | 276630337550045 |
9 | 51373111138506 |
10 | 13111520055333 |
11 | 41a5623288987 |
12 | 1579125655259 |
13 | 741546079c3b |
14 | 33485b04d057 |
15 | 17b0d9e3b323 |
hex | becc37ed025 |
13111520055333 has 32 divisors (see below), whose sum is σ = 20062453708800. Its totient is φ = 7461231178176.
The previous prime is 13111520055329. The next prime is 13111520055343. The reversal of 13111520055333 is 33355002511131.
It is not a de Polignac number, because 13111520055333 - 22 = 13111520055329 is a prime.
It is a super-2 number, since 2×131115200553332 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13111520055294 and 13111520055303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13111520055343) 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, 4339758 + ... + 6712416.
It is an arithmetic number, because the mean of its divisors is an integer number (626951678400).
Almost surely, 213111520055333 is an apocalyptic number.
It is an amenable number.
13111520055333 is a deficient number, since it is larger than the sum of its proper divisors (6950933653467).
13111520055333 is a wasteful number, since it uses less digits than its factorization.
13111520055333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2373761.
The product of its (nonzero) digits is 20250, while the sum is 33.
Adding to 13111520055333 its reverse (33355002511131), we get a palindrome (46466522566464).
The spelling of 13111520055333 in words is "thirteen trillion, one hundred eleven billion, five hundred twenty million, fifty-five thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •