Base | Representation |
---|---|
bin | 101110001100000101001111… |
… | …100000000100000010010001 |
3 | 222122021000212220001010201221 |
4 | 232030011033200010002101 |
5 | 203111223020403112423 |
6 | 2000013225023125041 |
7 | 60534260351030560 |
oct | 5614051740040221 |
9 | 878230786033657 |
10 | 203140402004113 |
11 | 597aa3a7087872 |
12 | 1a949b79743781 |
13 | 8947099a44612 |
14 | 38240956b1bd7 |
15 | 1874234961e5d |
hex | b8c14f804091 |
203140402004113 has 8 divisors (see below), whose sum is σ = 233550641826432. Its totient is φ = 173077707780096.
The previous prime is 203140402004081. The next prime is 203140402004179. The reversal of 203140402004113 is 311400204041302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 203140402004113 - 25 = 203140402004081 is a prime.
It is not an unprimeable number, because it can be changed into a prime (203140402004413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 86886398320 + ... + 86886400657.
It is an arithmetic number, because the mean of its divisors is an integer number (29193830228304).
Almost surely, 2203140402004113 is an apocalyptic number.
It is an amenable number.
203140402004113 is a deficient number, since it is larger than the sum of its proper divisors (30410239822319).
203140402004113 is a wasteful number, since it uses less digits than its factorization.
203140402004113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173772799151.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 203140402004113 its reverse (311400204041302), we get a palindrome (514540606045415).
The spelling of 203140402004113 in words is "two hundred three trillion, one hundred forty billion, four hundred two million, four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •