Base | Representation |
---|---|
bin | 1010001101000110001000… |
… | …1001000111001011010101 |
3 | 1110201122001010202201110201 |
4 | 2203101202021013023111 |
5 | 2432312231342224023 |
6 | 35510235430420501 |
7 | 2235424365015553 |
oct | 243214211071325 |
9 | 43648033681421 |
10 | 11220101133013 |
11 | 3636466644933 |
12 | 1312645201731 |
13 | 63508806a276 |
14 | 2ab0ad146bd3 |
15 | 146cd96c4bad |
hex | a34622472d5 |
11220101133013 has 8 divisors (see below), whose sum is σ = 11249520700320. Its totient is φ = 11190694144080.
The previous prime is 11220101133011. The next prime is 11220101133049. The reversal of 11220101133013 is 31033110102211.
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 11220101133013 - 21 = 11220101133011 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 (11220101133011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1356895 + ... + 4927612.
It is an arithmetic number, because the mean of its divisors is an integer number (1406190087540).
Almost surely, 211220101133013 is an apocalyptic number.
It is an amenable number.
11220101133013 is a deficient number, since it is larger than the sum of its proper divisors (29419567307).
11220101133013 is an equidigital number, since it uses as much as digits as its factorization.
11220101133013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6289187.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 11220101133013 its reverse (31033110102211), we get a palindrome (42253211235224).
The spelling of 11220101133013 in words is "eleven trillion, two hundred twenty billion, one hundred one million, one hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •