Base | Representation |
---|---|
bin | 101110001100111100110001… |
… | …101011110111001111111011 |
3 | 222122110201210120010101202220 |
4 | 232030330301223313033323 |
5 | 203113212131004320011 |
6 | 2000100450010255123 |
7 | 60541501126624653 |
oct | 5614746153671773 |
9 | 878421716111686 |
10 | 203200031323131 |
11 | 598227162a4807 |
12 | 1a95963b4274a3 |
13 | 894c8b075723b |
14 | 3826d10c33363 |
15 | 1875a74893506 |
hex | b8cf31af73fb |
203200031323131 has 64 divisors (see below), whose sum is σ = 288924722688000. Its totient is φ = 126802055646720.
The previous prime is 203200031323127. The next prime is 203200031323141. The reversal of 203200031323131 is 131323130002302.
It is not a de Polignac number, because 203200031323131 - 22 = 203200031323127 is a prime.
It is a super-2 number, since 2×2032000313231312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (203200031323111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 8294205120 + ... + 8294229618.
It is an arithmetic number, because the mean of its divisors is an integer number (4514448792000).
Almost surely, 2203200031323131 is an apocalyptic number.
203200031323131 is a deficient number, since it is larger than the sum of its proper divisors (85724691364869).
203200031323131 is a wasteful number, since it uses less digits than its factorization.
203200031323131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38676.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 203200031323131 its reverse (131323130002302), we get a palindrome (334523161325433).
The spelling of 203200031323131 in words is "two hundred three trillion, two hundred billion, thirty-one million, three hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •