Base | Representation |
---|---|
bin | 1011110101011001100… |
… | …1101000100010100101 |
3 | 201102210020022200212012 |
4 | 2331112121220202211 |
5 | 11312341113220031 |
6 | 233222315404005 |
7 | 20455200116414 |
oct | 2752631504245 |
9 | 642706280765 |
10 | 203313023141 |
11 | 792519a0558 |
12 | 334a1153605 |
13 | 162318110b7 |
14 | 9baa0cb47b |
15 | 544e24ab2b |
hex | 2f566688a5 |
203313023141 has 16 divisors (see below), whose sum is σ = 208719161856. Its totient is φ = 197954203776.
The previous prime is 203313023131. The next prime is 203313023167. The reversal of 203313023141 is 141320313302.
203313023141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-203313023141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203313023131) by changing a digit.
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, 8411225 + ... + 8435361.
It is an arithmetic number, because the mean of its divisors is an integer number (13044947616).
Almost surely, 2203313023141 is an apocalyptic number.
It is an amenable number.
203313023141 is a deficient number, since it is larger than the sum of its proper divisors (5406138715).
203313023141 is a wasteful number, since it uses less digits than its factorization.
203313023141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25108.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 203313023141 its reverse (141320313302), we get a palindrome (344633336443).
The spelling of 203313023141 in words is "two hundred three billion, three hundred thirteen million, twenty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •