Base | Representation |
---|---|
bin | 101100011011011101100… |
… | …000010101001000001001 |
3 | 101210212200210020102000122 |
4 | 230123131200111020021 |
5 | 400010314103120131 |
6 | 10254332230513025 |
7 | 433403505321422 |
oct | 54333540251011 |
9 | 11725623212018 |
10 | 3053143020041 |
11 | a77915704254 |
12 | 413877505775 |
13 | 191baa7aacaa |
14 | a7ab6c1c649 |
15 | 54644ecdd7b |
hex | 2c6dd815209 |
3053143020041 has 4 divisors (see below), whose sum is σ = 3057155035284. Its totient is φ = 3049131004800.
The previous prime is 3053143020013. The next prime is 3053143020047. The reversal of 3053143020041 is 1400203413503.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 962527777225 + 2090615242816 = 981085^2 + 1445896^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3053143020041 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (3053143020047) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2006006480 + ... + 2006008001.
It is an arithmetic number, because the mean of its divisors is an integer number (764288758821).
Almost surely, 23053143020041 is an apocalyptic number.
It is an amenable number.
3053143020041 is a deficient number, since it is larger than the sum of its proper divisors (4012015243).
3053143020041 is an equidigital number, since it uses as much as digits as its factorization.
3053143020041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4012015242.
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 3053143020041 its reverse (1400203413503), we get a palindrome (4453346433544).
The spelling of 3053143020041 in words is "three trillion, fifty-three billion, one hundred forty-three million, twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •