Base | Representation |
---|---|
bin | 10100111001101010… |
… | …00110101100000001 |
3 | 1001222000111000012221 |
4 | 22130311012230001 |
5 | 140440100220223 |
6 | 5053243051041 |
7 | 545032534042 |
oct | 123465065401 |
9 | 31860430187 |
10 | 11221101313 |
11 | 4839023554 |
12 | 2211b10a81 |
13 | 109a98c426 |
14 | 7863c68c9 |
15 | 45a1b5b5d |
hex | 29cd46b01 |
11221101313 has 8 divisors (see below), whose sum is σ = 11414932200. Its totient is φ = 11028892800.
The previous prime is 11221101299. The next prime is 11221101337. The reversal of 11221101313 is 31310112211.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1437319744 + 9783781569 = 37912^2 + 98913^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11221101313 is a prime.
It is a super-2 number, since 2×112211013132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11221101613) 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, 391638 + ... + 419311.
It is an arithmetic number, because the mean of its divisors is an integer number (1426866525).
Almost surely, 211221101313 is an apocalyptic number.
It is an amenable number.
11221101313 is a deficient number, since it is larger than the sum of its proper divisors (193830887).
11221101313 is a wasteful number, since it uses less digits than its factorization.
11221101313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 811187.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 11221101313 its reverse (31310112211), we get a palindrome (42531213524).
The spelling of 11221101313 in words is "eleven billion, two hundred twenty-one million, one hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •