Base | Representation |
---|---|
bin | 1100000111010101010010… |
… | …0011101010101110110110 |
3 | 1202011101112112010020200202 |
4 | 3001311110203222232312 |
5 | 3221214042212033420 |
6 | 44155101452240502 |
7 | 2543226540523142 |
oct | 301652443525666 |
9 | 52141475106622 |
10 | 13320112221110 |
11 | 4276034104432 |
12 | 15b163a770132 |
13 | 7581094c3c76 |
14 | 3409a8302222 |
15 | 18174787c575 |
hex | c1d548eabb6 |
13320112221110 has 8 divisors (see below), whose sum is σ = 23976201998016. Its totient is φ = 5328044888440.
The previous prime is 13320112221067. The next prime is 13320112221113. The reversal of 13320112221110 is 1112221102331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13320112221113) 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, 666005611046 + ... + 666005611065.
It is an arithmetic number, because the mean of its divisors is an integer number (2997025249752).
Almost surely, 213320112221110 is an apocalyptic number.
13320112221110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13320112221110 is a deficient number, since it is larger than the sum of its proper divisors (10656089776906).
13320112221110 is a wasteful number, since it uses less digits than its factorization.
13320112221110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1332011222118.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 13320112221110 its reverse (1112221102331), we get a palindrome (14432333323441).
The spelling of 13320112221110 in words is "thirteen trillion, three hundred twenty billion, one hundred twelve million, two hundred twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •