Base | Representation |
---|---|
bin | 11101110101110101111110… |
… | …000101011000001110001101 |
3 | 122012200202020100210221120201 |
4 | 131311311332011120032031 |
5 | 114200243021314044041 |
6 | 1143044222211413501 |
7 | 36434011365636541 |
oct | 3565657605301615 |
9 | 565622210727521 |
10 | 131243431003021 |
11 | 38900032323747 |
12 | 12877a335b4291 |
13 | 58302829b193c |
14 | 245a304811a21 |
15 | 1028e22099631 |
hex | 775d7e15838d |
131243431003021 has 16 divisors (see below), whose sum is σ = 139520319140160. Its totient is φ = 123103503388800.
The previous prime is 131243431003001. The next prime is 131243431003031. The reversal of 131243431003021 is 120300134342131.
It is a cyclic number.
It is not a de Polignac number, because 131243431003021 - 223 = 131243422614413 is a prime.
It is a super-2 number, since 2×1312434310030212 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131243431003001) 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, 207813690 + ... + 208444276.
It is an arithmetic number, because the mean of its divisors is an integer number (8720019946260).
Almost surely, 2131243431003021 is an apocalyptic number.
It is an amenable number.
131243431003021 is a deficient number, since it is larger than the sum of its proper divisors (8276888137139).
131243431003021 is a wasteful number, since it uses less digits than its factorization.
131243431003021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 739164.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 131243431003021 its reverse (120300134342131), we get a palindrome (251543565345152).
The spelling of 131243431003021 in words is "one hundred thirty-one trillion, two hundred forty-three billion, four hundred thirty-one million, three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •