Base | Representation |
---|---|
bin | 11101110100001101011111… |
… | …001110110110100001001101 |
3 | 122012022000122212122001102112 |
4 | 131310031133032312201031 |
5 | 114141423242011234041 |
6 | 1142520510104033405 |
7 | 36422630322132521 |
oct | 3564153716664115 |
9 | 565260585561375 |
10 | 131131244243021 |
11 | 388674a2877470 |
12 | 1285a144462865 |
13 | 582281443a909 |
14 | 2454b01039d81 |
15 | 1026057eecdeb |
hex | 77435f3b684d |
131131244243021 has 16 divisors (see below), whose sum is σ = 144560587104576. Its totient is φ = 117954790800000.
The previous prime is 131131244242937. The next prime is 131131244243029. The reversal of 131131244243021 is 120342442131131.
It is not a de Polignac number, because 131131244243021 - 222 = 131131240048717 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131131244243029) 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, 35819840 + ... + 39310601.
It is an arithmetic number, because the mean of its divisors is an integer number (9035036694036).
Almost surely, 2131131244243021 is an apocalyptic number.
131131244243021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
131131244243021 is a deficient number, since it is larger than the sum of its proper divisors (13429342861555).
131131244243021 is a wasteful number, since it uses less digits than its factorization.
131131244243021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75132124.
The product of its (nonzero) digits is 13824, while the sum is 32.
Adding to 131131244243021 its reverse (120342442131131), we get a palindrome (251473686374152).
The spelling of 131131244243021 in words is "one hundred thirty-one trillion, one hundred thirty-one billion, two hundred forty-four million, two hundred forty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •