Base | Representation |
---|---|
bin | 1010001100101101010100… |
… | …0111110000101100001101 |
3 | 1110200222211221002111002101 |
4 | 2203023111013300230031 |
5 | 2432210111144132023 |
6 | 35503214444155101 |
7 | 2235100334150026 |
oct | 243132507605415 |
9 | 43628757074071 |
10 | 11213440224013 |
11 | 3633658744365 |
12 | 13112a6538a91 |
13 | 63456609acb1 |
14 | 2aaa3a657c4d |
15 | 146a49a3c1ad |
hex | a32d51f0b0d |
11213440224013 has 4 divisors (see below), whose sum is σ = 11371376001888. Its totient is φ = 11055504446140.
The previous prime is 11213440224001. The next prime is 11213440224017. The reversal of 11213440224013 is 31042204431211.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11213440224013 - 25 = 11213440223981 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 (11213440224017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 78967888831 + ... + 78967888972.
It is an arithmetic number, because the mean of its divisors is an integer number (2842844000472).
Almost surely, 211213440224013 is an apocalyptic number.
It is an amenable number.
11213440224013 is a deficient number, since it is larger than the sum of its proper divisors (157935777875).
11213440224013 is an equidigital number, since it uses as much as digits as its factorization.
11213440224013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157935777874.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 11213440224013 its reverse (31042204431211), we get a palindrome (42255644655224).
The spelling of 11213440224013 in words is "eleven trillion, two hundred thirteen billion, four hundred forty million, two hundred twenty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •