Base | Representation |
---|---|
bin | 10011001111001101111… |
… | …100101111011100100011 |
3 | 11200101100011110002010001 |
4 | 103033031330233130203 |
5 | 133124434103242011 |
6 | 2451153442520431 |
7 | 164340434252140 |
oct | 23171574573443 |
9 | 4611304402101 |
10 | 1322010212131 |
11 | 46a730333354 |
12 | 19426a666117 |
13 | 978850b36bb |
14 | 47db28273c7 |
15 | 245c63be7c1 |
hex | 133cdf2f723 |
1322010212131 has 16 divisors (see below), whose sum is σ = 1645229203200. Its totient is φ = 1036494391968.
The previous prime is 1322010212111. The next prime is 1322010212141. The reversal of 1322010212131 is 1312120102231.
It is not a de Polignac number, because 1322010212131 - 235 = 1287650473763 is a prime.
It is a super-2 number, since 2×13220102121312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1322010212099 and 1322010212108.
It is not an unprimeable number, because it can be changed into a prime (1322010212111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 171374185 + ... + 171381898.
It is an arithmetic number, because the mean of its divisors is an integer number (102826825200).
Almost surely, 21322010212131 is an apocalyptic number.
1322010212131 is a deficient number, since it is larger than the sum of its proper divisors (323218991069).
1322010212131 is a wasteful number, since it uses less digits than its factorization.
1322010212131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 342756138.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1322010212131 its reverse (1312120102231), we get a palindrome (2634130314362).
The spelling of 1322010212131 in words is "one trillion, three hundred twenty-two billion, ten million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •