Base | Representation |
---|---|
bin | 11000100111001001… |
… | …10010000010010001 |
3 | 1021002212011202022101 |
4 | 30103210302002101 |
5 | 204030101423441 |
6 | 10023051040401 |
7 | 645303201643 |
oct | 142344620221 |
9 | 37085152271 |
10 | 13213311121 |
11 | 567062a23a |
12 | 2689140101 |
13 | 13276399ba |
14 | 8d4c14893 |
15 | 52503a231 |
hex | 313932091 |
13213311121 has 8 divisors (see below), whose sum is σ = 13790977704. Its totient is φ = 12647806080.
The previous prime is 13213311119. The next prime is 13213311127. The reversal of 13213311121 is 12111331231.
It can be written as a sum of positive squares in 4 ways, for example, as 226201600 + 12987109521 = 15040^2 + 113961^2 .
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 13213311121 - 21 = 13213311119 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13213311127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3038166 + ... + 3042511.
It is an arithmetic number, because the mean of its divisors is an integer number (1723872213).
Almost surely, 213213311121 is an apocalyptic number.
It is an amenable number.
13213311121 is a deficient number, since it is larger than the sum of its proper divisors (577666583).
13213311121 is an equidigital number, since it uses as much as digits as its factorization.
13213311121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6080771.
The product of its digits is 108, while the sum is 19.
Adding to 13213311121 its reverse (12111331231), we get a palindrome (25324642352).
The spelling of 13213311121 in words is "thirteen billion, two hundred thirteen million, three hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •