Base | Representation |
---|---|
bin | 1011110101011100000… |
… | …0111000000000110011 |
3 | 201102210221200022221211 |
4 | 2331113000320000303 |
5 | 11312401231411011 |
6 | 233223324100551 |
7 | 20455353422554 |
oct | 2752700700063 |
9 | 642727608854 |
10 | 203323310131 |
11 | 792577872a7 |
12 | 334a4694757 |
13 | 162339a3486 |
14 | 9bab60832b |
15 | 54500cdb21 |
hex | 2f57038033 |
203323310131 has 8 divisors (see below), whose sum is σ = 214050529280. Its totient is φ = 192598690248.
The previous prime is 203323310119. The next prime is 203323310171. The reversal of 203323310131 is 131013323302.
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 203323310131 - 213 = 203323301939 is a prime.
It is a super-2 number, since 2×2033233101312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (203323310111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 488211 + ... + 803116.
It is an arithmetic number, because the mean of its divisors is an integer number (26756316160).
Almost surely, 2203323310131 is an apocalyptic number.
203323310131 is a deficient number, since it is larger than the sum of its proper divisors (10727219149).
203323310131 is a wasteful number, since it uses less digits than its factorization.
203323310131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1299633.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 203323310131 its reverse (131013323302), we get a palindrome (334336633433).
The spelling of 203323310131 in words is "two hundred three billion, three hundred twenty-three million, three hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •