Base | Representation |
---|---|
bin | 11101110101011000101100… |
… | …101110111101110101100101 |
3 | 122012120202002222110210120112 |
4 | 131311120230232331311211 |
5 | 114144234134324332323 |
6 | 1143021543350142405 |
7 | 36431516466511364 |
oct | 3565305456756545 |
9 | 565522088423515 |
10 | 131212001402213 |
11 | 38898774113446 |
12 | 12871921951a05 |
13 | 582a3143a5a04 |
14 | 24589a258b7db |
15 | 10281d2bd0178 |
hex | 77562cbbdd65 |
131212001402213 has 16 divisors (see below), whose sum is σ = 135557822400000. Its totient is φ = 126873261066240.
The previous prime is 131212001402201. The next prime is 131212001402231. The reversal of 131212001402213 is 312204100212131.
It is a cyclic number.
It is not a de Polignac number, because 131212001402213 - 230 = 131210927660389 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131212007402213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1881437498 + ... + 1881507236.
It is an arithmetic number, because the mean of its divisors is an integer number (8472363900000).
Almost surely, 2131212001402213 is an apocalyptic number.
It is an amenable number.
131212001402213 is a deficient number, since it is larger than the sum of its proper divisors (4345820997787).
131212001402213 is a wasteful number, since it uses less digits than its factorization.
131212001402213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119612.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 131212001402213 its reverse (312204100212131), we get a palindrome (443416101614344).
The spelling of 131212001402213 in words is "one hundred thirty-one trillion, two hundred twelve billion, one million, four hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •