Base | Representation |
---|---|
bin | 101110001010000101010010… |
… | …010111010111011000000011 |
3 | 222121202220020212211011201122 |
4 | 232022011102113113120003 |
5 | 203102000131320232321 |
6 | 1555430143523222455 |
7 | 60521324600444345 |
oct | 5612052227273003 |
9 | 877686225734648 |
10 | 203003011102211 |
11 | 59757103542751 |
12 | 1a927415817a2b |
13 | 893714288c768 |
14 | 381b5807b3295 |
15 | 1870892d1b8ab |
hex | b8a1525d7603 |
203003011102211 has 8 divisors (see below), whose sum is σ = 203174265323520. Its totient is φ = 202831808296392.
The previous prime is 203003011102187. The next prime is 203003011102271. The reversal of 203003011102211 is 112201110300302.
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 203003011102211 - 238 = 202728133195267 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 203003011102211.
It is not an unprimeable number, because it can be changed into a prime (203003011102271) 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, 4951925 + ... + 20749158.
It is an arithmetic number, because the mean of its divisors is an integer number (25396783165440).
Almost surely, 2203003011102211 is an apocalyptic number.
203003011102211 is a deficient number, since it is larger than the sum of its proper divisors (171254221309).
203003011102211 is a wasteful number, since it uses less digits than its factorization.
203003011102211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25707745.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 203003011102211 its reverse (112201110300302), we get a palindrome (315204121402513).
The spelling of 203003011102211 in words is "two hundred three trillion, three billion, eleven million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •