Base | Representation |
---|---|
bin | 1011111011010010001011… |
… | …1111011100110101100101 |
3 | 1201102121021000220101000021 |
4 | 2332310202333130311211 |
5 | 3204321133241310341 |
6 | 43520030222115141 |
7 | 2522251251504322 |
oct | 276644277346545 |
9 | 51377230811007 |
10 | 13113122213221 |
11 | 41a62756a3908 |
12 | 15794b211bab1 |
13 | 74173cc89c64 |
14 | 33496db45b49 |
15 | 17b1809149d1 |
hex | bed22fdcd65 |
13113122213221 has 4 divisors (see below), whose sum is σ = 13167988833600. Its totient is φ = 13058255592844.
The previous prime is 13113122213167. The next prime is 13113122213287. The reversal of 13113122213221 is 12231222131131.
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 13113122213221 - 229 = 13112585342309 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 (13113122613221) 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, 27433309831 + ... + 27433310308.
It is an arithmetic number, because the mean of its divisors is an integer number (3291997208400).
Almost surely, 213113122213221 is an apocalyptic number.
It is an amenable number.
13113122213221 is a deficient number, since it is larger than the sum of its proper divisors (54866620379).
13113122213221 is an equidigital number, since it uses as much as digits as its factorization.
13113122213221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54866620378.
The product of its digits is 864, while the sum is 25.
Adding to 13113122213221 its reverse (12231222131131), we get a palindrome (25344344344352).
The spelling of 13113122213221 in words is "thirteen trillion, one hundred thirteen billion, one hundred twenty-two million, two hundred thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •