Base | Representation |
---|---|
bin | 1011110110100110010… |
… | …0100000100011110101 |
3 | 201110121122111120210222 |
4 | 2331221210200203311 |
5 | 11314020432004031 |
6 | 233314245024125 |
7 | 20466153614261 |
oct | 2755144404365 |
9 | 643548446728 |
10 | 203634641141 |
11 | 793a749a958 |
12 | 335709b5045 |
13 | 1628333a8c9 |
14 | 9bdaacb0a1 |
15 | 546c5c9e7b |
hex | 2f699208f5 |
203634641141 has 8 divisors (see below), whose sum is σ = 204620820768. Its totient is φ = 202649850000.
The previous prime is 203634641137. The next prime is 203634641143. The reversal of 203634641141 is 141146436302.
203634641141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 203634641141 - 22 = 203634641137 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203634641143) 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, 52490 + ... + 640331.
It is an arithmetic number, because the mean of its divisors is an integer number (25577602596).
Almost surely, 2203634641141 is an apocalyptic number.
It is an amenable number.
203634641141 is a deficient number, since it is larger than the sum of its proper divisors (986179627).
203634641141 is a wasteful number, since it uses less digits than its factorization.
203634641141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 694243.
The product of its (nonzero) digits is 41472, while the sum is 35.
The spelling of 203634641141 in words is "two hundred three billion, six hundred thirty-four million, six hundred forty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •