Base | Representation |
---|---|
bin | 1100010010101111110010… |
… | …0100110101000010111111 |
3 | 1202212010200112120112120110 |
4 | 3010223330210311002333 |
5 | 3232422141341013421 |
6 | 44425131513121103 |
7 | 2563341102463665 |
oct | 304537444650277 |
9 | 52763615515513 |
10 | 13516204626111 |
11 | 4341210165680 |
12 | 16236456b9193 |
13 | 77075a0a6245 |
14 | 34a28b444c35 |
15 | 1868c2c30a76 |
hex | c4afc9350bf |
13516204626111 has 64 divisors (see below), whose sum is σ = 20032717824000. Its totient is φ = 8037507273600.
The previous prime is 13516204626091. The next prime is 13516204626163. The reversal of 13516204626111 is 11162640261531.
It is not a de Polignac number, because 13516204626111 - 210 = 13516204625087 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13516204626111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13516204626811) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 459735790 + ... + 459765188.
It is an arithmetic number, because the mean of its divisors is an integer number (313011216000).
Almost surely, 213516204626111 is an apocalyptic number.
13516204626111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13516204626111 is a deficient number, since it is larger than the sum of its proper divisors (6516513197889).
13516204626111 is a wasteful number, since it uses less digits than its factorization.
13516204626111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30420.
The product of its (nonzero) digits is 51840, while the sum is 39.
Adding to 13516204626111 its reverse (11162640261531), we get a palindrome (24678844887642).
The spelling of 13516204626111 in words is "thirteen trillion, five hundred sixteen billion, two hundred four million, six hundred twenty-six thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •