Base | Representation |
---|---|
bin | 1011110100100111100… |
… | …0100000100011110110 |
3 | 201102020121011002020220 |
4 | 2331021320200203312 |
5 | 11311423332404420 |
6 | 233145414235210 |
7 | 20450040061314 |
oct | 2751170404366 |
9 | 642217132226 |
10 | 203103013110 |
11 | 791543a0948 |
12 | 33442955b06 |
13 | 161ca1607ca |
14 | 9b8a2610b4 |
15 | 543aab5840 |
hex | 2f49e208f6 |
203103013110 has 32 divisors (see below), whose sum is σ = 489594592512. Its totient is φ = 53922207840.
The previous prime is 203103013097. The next prime is 203103013177. The reversal of 203103013110 is 11310301302.
203103013110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 203103013110.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 14905306 + ... + 14918925.
It is an arithmetic number, because the mean of its divisors is an integer number (15299831016).
Almost surely, 2203103013110 is an apocalyptic number.
203103013110 is an abundant number, since it is smaller than the sum of its proper divisors (286491579402).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
203103013110 is a wasteful number, since it uses less digits than its factorization.
203103013110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29824468.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 203103013110 its reverse (11310301302), we get a palindrome (214413314412).
The spelling of 203103013110 in words is "two hundred three billion, one hundred three million, thirteen thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •