Base | Representation |
---|---|
bin | 1011110100101001001… |
… | …1001100110010011100 |
3 | 201102021002022120012102 |
4 | 2331022103030302130 |
5 | 11311432130310022 |
6 | 233150224224232 |
7 | 20450153412410 |
oct | 2751223146234 |
9 | 642232276172 |
10 | 203110010012 |
11 | 7915833a808 |
12 | 3344516b078 |
13 | 161cb7404a0 |
14 | 9b8b162d40 |
15 | 543b4e8a92 |
hex | 2f4a4ccc9c |
203110010012 has 24 divisors (see below), whose sum is σ = 437467714656. Its totient is φ = 80351212608.
The previous prime is 203110009997. The next prime is 203110010107. The reversal of 203110010012 is 210010011302.
203110010012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 203110009975 and 203110010002.
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 7 ways as a sum of consecutive naturals, for example, 278996903 + ... + 278997630.
It is an arithmetic number, because the mean of its divisors is an integer number (18227821444).
Almost surely, 2203110010012 is an apocalyptic number.
It is an amenable number.
203110010012 is an abundant number, since it is smaller than the sum of its proper divisors (234357704644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
203110010012 is a wasteful number, since it uses less digits than its factorization.
203110010012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 557994557 (or 557994555 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 203110010012 its reverse (210010011302), we get a palindrome (413120021314).
The spelling of 203110010012 in words is "two hundred three billion, one hundred ten million, ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •