Base | Representation |
---|---|
bin | 1011111011101111100111… |
… | …0100001010001101111111 |
3 | 1201110100122112110200022210 |
4 | 2332323321310022031333 |
5 | 3204433322424301421 |
6 | 43523414115311503 |
7 | 2522651066021313 |
oct | 276737164121577 |
9 | 51410575420283 |
10 | 13121021322111 |
11 | 41a965952127a |
12 | 157ab375ab593 |
13 | 7423cb636aa1 |
14 | 3350bcc69b43 |
15 | 17b494131576 |
hex | beef9d0a37f |
13121021322111 has 16 divisors (see below), whose sum is σ = 17506428953184. Its totient is φ = 8741481176064.
The previous prime is 13121021322109. The next prime is 13121021322133. The reversal of 13121021322111 is 11122312012131.
It is not a de Polignac number, because 13121021322111 - 21 = 13121021322109 is a prime.
It is a super-2 number, since 2×131210213221112 (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 (13121021322811) 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 15 ways as a sum of consecutive naturals, for example, 115387195 + ... + 115500851.
It is an arithmetic number, because the mean of its divisors is an integer number (1094151809574).
Almost surely, 213121021322111 is an apocalyptic number.
13121021322111 is a deficient number, since it is larger than the sum of its proper divisors (4385407631073).
13121021322111 is a wasteful number, since it uses less digits than its factorization.
13121021322111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139130.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 13121021322111 its reverse (11122312012131), we get a palindrome (24243333334242).
The spelling of 13121021322111 in words is "thirteen trillion, one hundred twenty-one billion, twenty-one million, three hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •