Base | Representation |
---|---|
bin | 1011111010100001101101… |
… | …1110011000011110100011 |
3 | 1201101100200021101112021121 |
4 | 2332220123132120132203 |
5 | 3204113011431432321 |
6 | 43510035155033111 |
7 | 2521310652646525 |
oct | 276503336303643 |
9 | 51340607345247 |
10 | 13100111202211 |
11 | 41a07a9288750 |
12 | 1576a8089b797 |
13 | 740448531487 |
14 | 334097b51a15 |
15 | 17ab6d53a441 |
hex | bea1b7987a3 |
13100111202211 has 32 divisors (see below), whose sum is σ = 14843160057600. Its totient is φ = 11457851328000.
The previous prime is 13100111202193. The next prime is 13100111202223. The reversal of 13100111202211 is 11220211100131.
It is a happy number.
It is not a de Polignac number, because 13100111202211 - 27 = 13100111202083 is a prime.
It is a super-2 number, since 2×131001112022112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13100111202911) 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, 14782116 + ... + 15643246.
It is an arithmetic number, because the mean of its divisors is an integer number (463848751800).
Almost surely, 213100111202211 is an apocalyptic number.
13100111202211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13100111202211 is a deficient number, since it is larger than the sum of its proper divisors (1743048855389).
13100111202211 is a wasteful number, since it uses less digits than its factorization.
13100111202211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 861651.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 13100111202211 its reverse (11220211100131), we get a palindrome (24320322302342).
The spelling of 13100111202211 in words is "thirteen trillion, one hundred billion, one hundred eleven million, two hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •