Base | Representation |
---|---|
bin | 1100000110110000110110… |
… | …0011101100111010010111 |
3 | 1202010110021212020110221112 |
4 | 3001230031203230322113 |
5 | 3221034024231104421 |
6 | 44150403125205235 |
7 | 2542432261501244 |
oct | 301541543547227 |
9 | 52113255213845 |
10 | 13310331113111 |
11 | 4271974a061aa |
12 | 15ab76ab6081b |
13 | 75720ac76ab6 |
14 | 34031b27c5cb |
15 | 181373d0b45b |
hex | c1b0d8ece97 |
13310331113111 has 4 divisors (see below), whose sum is σ = 13634973335424. Its totient is φ = 12985688890800.
The previous prime is 13310331113089. The next prime is 13310331113113. The reversal of 13310331113111 is 11131113301331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13310331113111 - 210 = 13310331112087 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13310331113113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 162321111095 + ... + 162321111176.
It is an arithmetic number, because the mean of its divisors is an integer number (3408743333856).
Almost surely, 213310331113111 is an apocalyptic number.
13310331113111 is a deficient number, since it is larger than the sum of its proper divisors (324642222313).
13310331113111 is an equidigital number, since it uses as much as digits as its factorization.
13310331113111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 324642222312.
The product of its (nonzero) digits is 243, while the sum is 23.
Adding to 13310331113111 its reverse (11131113301331), we get a palindrome (24441444414442).
The spelling of 13310331113111 in words is "thirteen trillion, three hundred ten billion, three hundred thirty-one million, one hundred thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •