Base | Representation |
---|---|
bin | 1011110100101001011… |
… | …1000001011010110111 |
3 | 201102021011012110200221 |
4 | 2331022113001122313 |
5 | 11311432404341043 |
6 | 233150301515211 |
7 | 20450165054623 |
oct | 2751227013267 |
9 | 642234173627 |
10 | 203111012023 |
11 | 79158964617 |
12 | 33445572b07 |
13 | 161cba015aa |
14 | 9b8b344183 |
15 | 543b6458ed |
hex | 2f4a5c16b7 |
203111012023 has 4 divisors (see below), whose sum is σ = 205204940080. Its totient is φ = 201017083968.
The previous prime is 203111012017. The next prime is 203111012101. The reversal of 203111012023 is 320210111302.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 203111012023 - 233 = 194521077431 is a prime.
It is a super-3 number, since 3×2031110120233 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 203111011988 and 203111012006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203111012323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1046963883 + ... + 1046964076.
It is an arithmetic number, because the mean of its divisors is an integer number (51301235020).
Almost surely, 2203111012023 is an apocalyptic number.
203111012023 is a deficient number, since it is larger than the sum of its proper divisors (2093928057).
203111012023 is an equidigital number, since it uses as much as digits as its factorization.
203111012023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2093928056.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 203111012023 its reverse (320210111302), we get a palindrome (523321123325).
The spelling of 203111012023 in words is "two hundred three billion, one hundred eleven million, twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •