Base | Representation |
---|---|
bin | 1100000111010101101001… |
… | …1101101010110111101111 |
3 | 1202011101210102120120222211 |
4 | 3001311122131222313233 |
5 | 3221214243043441421 |
6 | 44155115352151251 |
7 | 2543232153011164 |
oct | 301653235526757 |
9 | 52141712516884 |
10 | 13320211312111 |
11 | 4276085034a20 |
12 | 15b1667998527 |
13 | 758123ba9ab2 |
14 | 3409b753806b |
15 | 1817514029e1 |
hex | c1d5a76adef |
13320211312111 has 8 divisors (see below), whose sum is σ = 15295936435200. Its totient is φ = 11471952326040.
The previous prime is 13320211311983. The next prime is 13320211312117. The reversal of 13320211312111 is 11121311202331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13320211312111 - 27 = 13320211311983 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 (13320211312117) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31866534031 + ... + 31866534448.
It is an arithmetic number, because the mean of its divisors is an integer number (1911992054400).
Almost surely, 213320211312111 is an apocalyptic number.
13320211312111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13320211312111 is a deficient number, since it is larger than the sum of its proper divisors (1975725123089).
13320211312111 is a wasteful number, since it uses less digits than its factorization.
13320211312111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63733068509.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 13320211312111 its reverse (11121311202331), we get a palindrome (24441522514442).
The spelling of 13320211312111 in words is "thirteen trillion, three hundred twenty billion, two hundred eleven million, three hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •