Base | Representation |
---|---|
bin | 101110001111111001010000… |
… | …000011001100110011101101 |
3 | 222200012002011021102202000202 |
4 | 232033321100003030303231 |
5 | 203130021110440021031 |
6 | 2000333435144003245 |
7 | 60562224123104030 |
oct | 5617712003146355 |
9 | 880162137382022 |
10 | 203402404220141 |
11 | 598a0525546615 |
12 | 1a9908b9760525 |
13 | 89659c2562889 |
14 | 3832a2c11b017 |
15 | 187ae6b2d82cb |
hex | b8fe500ccced |
203402404220141 has 8 divisors (see below), whose sum is σ = 232460553039744. Its totient is φ = 174344421026160.
The previous prime is 203402404220131. The next prime is 203402404220227. The reversal of 203402404220141 is 141022404204302.
It is a happy number.
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-203402404220141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203402404220131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38763545 + ... + 43696878.
It is an arithmetic number, because the mean of its divisors is an integer number (29057569129968).
Almost surely, 2203402404220141 is an apocalyptic number.
It is an amenable number.
203402404220141 is a deficient number, since it is larger than the sum of its proper divisors (29058148819603).
203402404220141 is an equidigital number, since it uses as much as digits as its factorization.
203402404220141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82812811.
The product of its (nonzero) digits is 12288, while the sum is 29.
Adding to 203402404220141 its reverse (141022404204302), we get a palindrome (344424808424443).
The spelling of 203402404220141 in words is "two hundred three trillion, four hundred two billion, four hundred four million, two hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •