Base | Representation |
---|---|
bin | 1100000010111011010000… |
… | …0000100010000110101101 |
3 | 1201220011010022010220112120 |
4 | 3000232310000202012231 |
5 | 3213444014434242031 |
6 | 44100221215023153 |
7 | 2534606453210004 |
oct | 300566400420655 |
9 | 51804108126476 |
10 | 13244404212141 |
11 | 4246a13995783 |
12 | 159aa3020aab9 |
13 | 750c3263611b |
14 | 33b0655a7c3b |
15 | 17e7b60aea96 |
hex | c0bb40221ad |
13244404212141 has 8 divisors (see below), whose sum is σ = 17992398175200. Its totient is φ = 8663006528592.
The previous prime is 13244404212107. The next prime is 13244404212161. The reversal of 13244404212141 is 14121240444231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-13244404212141 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13244404212101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41649069691 + ... + 41649070008.
It is an arithmetic number, because the mean of its divisors is an integer number (2249049771900).
Almost surely, 213244404212141 is an apocalyptic number.
It is an amenable number.
13244404212141 is a deficient number, since it is larger than the sum of its proper divisors (4747993963059).
13244404212141 is an equidigital number, since it uses as much as digits as its factorization.
13244404212141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83298139755.
The product of its (nonzero) digits is 24576, while the sum is 33.
Adding to 13244404212141 its reverse (14121240444231), we get a palindrome (27365644656372).
The spelling of 13244404212141 in words is "thirteen trillion, two hundred forty-four billion, four hundred four million, two hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •