Base | Representation |
---|---|
bin | 101110001100000110001011… |
… | …110101110100100110001000 |
3 | 222122021010111102221011212201 |
4 | 232030012023311310212020 |
5 | 203111232104032403000 |
6 | 2000013513305045544 |
7 | 60534324422533222 |
oct | 5614061365644610 |
9 | 878233442834781 |
10 | 203141414341000 |
11 | 597aa876567523 |
12 | 1a94a2007868b4 |
13 | 89471cb6b0c25 |
14 | 382414dd11412 |
15 | 187429377d96a |
hex | b8c18bd74988 |
203141414341000 has 64 divisors (see below), whose sum is σ = 475597082338560. Its totient is φ = 81214484920000.
The previous prime is 203141414340971. The next prime is 203141414341069. The reversal of 203141414341000 is 143414141302.
It is a self number, because there is not a number n which added to its sum of digits gives 203141414341000.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 50669056 + ... + 54531055.
It is an arithmetic number, because the mean of its divisors is an integer number (7431204411540).
Almost surely, 2203141414341000 is an apocalyptic number.
203141414341000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
203141414341000 is an abundant number, since it is smaller than the sum of its proper divisors (272455667997560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
203141414341000 is a wasteful number, since it uses less digits than its factorization.
203141414341000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105202063 (or 105202049 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 203141414341000 its reverse (143414141302), we get a palindrome (203284828482302).
The spelling of 203141414341000 in words is "two hundred three trillion, one hundred forty-one billion, four hundred fourteen million, three hundred forty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •