Base | Representation |
---|---|
bin | 11000100101110011… |
… | …10011010011101101 |
3 | 1021002001222022220211 |
4 | 30102321303103231 |
5 | 204014210403031 |
6 | 10022005342421 |
7 | 645105344416 |
oct | 142271632355 |
9 | 37061868824 |
10 | 13202044141 |
11 | 5665234190 |
12 | 2685407a11 |
13 | 13251c3550 |
14 | 8d352080d |
15 | 524061bb1 |
hex | 312e734ed |
13202044141 has 8 divisors (see below), whose sum is σ = 15510093984. Its totient is φ = 11078638320.
The previous prime is 13202044123. The next prime is 13202044147. The reversal of 13202044141 is 14144020231.
It is a happy number.
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 13202044141 - 25 = 13202044109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13202044147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 46160851 + ... + 46161136.
It is an arithmetic number, because the mean of its divisors is an integer number (1938761748).
Almost surely, 213202044141 is an apocalyptic number.
13202044141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13202044141 is a deficient number, since it is larger than the sum of its proper divisors (2308049843).
13202044141 is a wasteful number, since it uses less digits than its factorization.
13202044141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92322011.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 13202044141 its reverse (14144020231), we get a palindrome (27346064372).
The spelling of 13202044141 in words is "thirteen billion, two hundred two million, forty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •