Base | Representation |
---|---|
bin | 11101101100111101100… |
… | …000001000101111101011 |
3 | 21020010112122110110000110 |
4 | 131230331200020233223 |
5 | 231420224133101303 |
6 | 4201404245505403 |
7 | 300316245533505 |
oct | 35547540105753 |
9 | 7203478413013 |
10 | 2041141300203 |
11 | 717709062635 |
12 | 28b706112263 |
13 | 11a62bbc7ba5 |
14 | 70b1286ad75 |
15 | 38164ca7703 |
hex | 1db3d808beb |
2041141300203 has 8 divisors (see below), whose sum is σ = 2733202085328. Its totient is φ = 1354920690944.
The previous prime is 2041141300201. The next prime is 2041141300277. The reversal of 2041141300203 is 3020031411402.
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 2041141300203 - 21 = 2041141300201 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2041141300203.
It is not an unprimeable number, because it can be changed into a prime (2041141300201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1460043150 + ... + 1460044547.
It is an arithmetic number, because the mean of its divisors is an integer number (341650260666).
Almost surely, 22041141300203 is an apocalyptic number.
2041141300203 is a deficient number, since it is larger than the sum of its proper divisors (692060785125).
2041141300203 is a wasteful number, since it uses less digits than its factorization.
2041141300203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2920087933.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 2041141300203 its reverse (3020031411402), we get a palindrome (5061172711605).
The spelling of 2041141300203 in words is "two trillion, forty-one billion, one hundred forty-one million, three hundred thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •