Base | Representation |
---|---|
bin | 110111100000100101000001… |
… | …010110001011011111011101 |
3 | 1012000101201122022100012210002 |
4 | 313200211001112023133131 |
5 | 223444321432043431323 |
6 | 2223120215201024045 |
7 | 102264623000406221 |
oct | 6740450126133735 |
9 | 1160351568305702 |
10 | 244131332405213 |
11 | 70873575719950 |
12 | 2346a355325025 |
13 | a62b641599536 |
14 | 444003b862781 |
15 | 1d35639a6b828 |
hex | de094158b7dd |
244131332405213 has 8 divisors (see below), whose sum is σ = 268088832215616. Its totient is φ = 220467789648000.
The previous prime is 244131332405201. The next prime is 244131332405221. The reversal of 244131332405213 is 312504233131442.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 244131332405213 - 228 = 244131063969757 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 (244131332405413) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 73489261556 + ... + 73489264877.
It is an arithmetic number, because the mean of its divisors is an integer number (33511104026952).
Almost surely, 2244131332405213 is an apocalyptic number.
It is an amenable number.
244131332405213 is a deficient number, since it is larger than the sum of its proper divisors (23957499810403).
244131332405213 is a wasteful number, since it uses less digits than its factorization.
244131332405213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146978526595.
The product of its (nonzero) digits is 207360, while the sum is 38.
Adding to 244131332405213 its reverse (312504233131442), we get a palindrome (556635565536655).
The spelling of 244131332405213 in words is "two hundred forty-four trillion, one hundred thirty-one billion, three hundred thirty-two million, four hundred five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •