Base | Representation |
---|---|
bin | 1011111010100101000110… |
… | …1010000000111101111111 |
3 | 1201101110000121212111001200 |
4 | 2332221101222000331333 |
5 | 3204121342134040221 |
6 | 43510305310310543 |
7 | 2521342331331141 |
oct | 276512152007577 |
9 | 51343017774050 |
10 | 13101020221311 |
11 | 41a1125410200 |
12 | 15770951b8453 |
13 | 7405619650b9 |
14 | 334142778c91 |
15 | 17abc3249426 |
hex | bea51a80f7f |
13101020221311 has 216 divisors, whose sum is σ = 22707628266960. Its totient is φ = 7252275824640.
The previous prime is 13101020221307. The next prime is 13101020221327. The reversal of 13101020221311 is 11312202010131.
13101020221311 is a `hidden beast` number, since 1 + 31 + 0 + 102 + 0 + 221 + 311 = 666.
It is not a de Polignac number, because 13101020221311 - 22 = 13101020221307 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13101020221351) by changing a digit.
It is a polite number, since it can be written in 215 ways as a sum of consecutive naturals, for example, 3200833581 + ... + 3200837673.
Almost surely, 213101020221311 is an apocalyptic number.
13101020221311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13101020221311 is a deficient number, since it is larger than the sum of its proper divisors (9606608045649).
13101020221311 is a wasteful number, since it uses less digits than its factorization.
13101020221311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4327 (or 4276 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 13101020221311 its reverse (11312202010131), we get a palindrome (24413222231442).
It can be divided in two parts, 13101020 and 221311, that added together give a palindrome (13322331).
The spelling of 13101020221311 in words is "thirteen trillion, one hundred one billion, twenty million, two hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •