Base | Representation |
---|---|
bin | 1011110100101110100… |
… | …0010100010110001011 |
3 | 201102022122022012011012 |
4 | 2331023220110112023 |
5 | 11312003333320321 |
6 | 233152342354135 |
7 | 20450544154436 |
oct | 2751350242613 |
9 | 642278265135 |
10 | 203132323211 |
11 | 7916999aa74 |
12 | 3345072b94b |
13 | 1620325376c |
14 | 9b900d081d |
15 | 543d45505b |
hex | 2f4ba1458b |
203132323211 has 4 divisors (see below), whose sum is σ = 203133562632. Its totient is φ = 203131083792.
The previous prime is 203132323159. The next prime is 203132323237. The reversal of 203132323211 is 112323231302.
203132323211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 203132323211 - 234 = 185952454027 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (203132323411) 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 3 ways as a sum of consecutive naturals, for example, 328145 + ... + 716898.
It is an arithmetic number, because the mean of its divisors is an integer number (50783390658).
Almost surely, 2203132323211 is an apocalyptic number.
203132323211 is a deficient number, since it is larger than the sum of its proper divisors (1239421).
203132323211 is a wasteful number, since it uses less digits than its factorization.
203132323211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1239420.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 203132323211 its reverse (112323231302), we get a palindrome (315455554513).
The spelling of 203132323211 in words is "two hundred three billion, one hundred thirty-two million, three hundred twenty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •