Base | Representation |
---|---|
bin | 10011000111001110101… |
… | …010010011011000011011 |
3 | 11122120012100102222201122 |
4 | 103013032222103120123 |
5 | 133004402122034321 |
6 | 2443214334435455 |
7 | 163615034450225 |
oct | 23071652233033 |
9 | 4576170388648 |
10 | 1313432221211 |
11 | 46702927a860 |
12 | 192675962b8b |
13 | 96b18bac726 |
14 | 477db4a5415 |
15 | 242732a28ab |
hex | 131cea9361b |
1313432221211 has 24 divisors (see below), whose sum is σ = 1481432762304. Its totient is φ = 1154233946880.
The previous prime is 1313432221193. The next prime is 1313432221271. The reversal of 1313432221211 is 1121222343131.
It is a de Polignac number, because none of the positive numbers 2k-1313432221211 is a prime.
It is a super-2 number, since 2×13134322212112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1313432221271) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4302896 + ... + 4598018.
It is an arithmetic number, because the mean of its divisors is an integer number (61726365096).
Almost surely, 21313432221211 is an apocalyptic number.
1313432221211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1313432221211 is a deficient number, since it is larger than the sum of its proper divisors (168000541093).
1313432221211 is an equidigital number, since it uses as much as digits as its factorization.
1313432221211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295371 (or 295274 counting only the distinct ones).
The product of its digits is 1728, while the sum is 26.
Adding to 1313432221211 its reverse (1121222343131), we get a palindrome (2434654564342).
The spelling of 1313432221211 in words is "one trillion, three hundred thirteen billion, four hundred thirty-two million, two hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •