Base | Representation |
---|---|
bin | 1011110100010001101… |
… | …0110001000101101011 |
3 | 201102000012122010020101 |
4 | 2331010122301011223 |
5 | 11311231400033121 |
6 | 233132341210231 |
7 | 20444544556651 |
oct | 2750432610553 |
9 | 642005563211 |
10 | 203011330411 |
11 | 7910767031a |
12 | 33418100977 |
13 | 161b416c9a6 |
14 | 9b7bdd6dd1 |
15 | 5432a05491 |
hex | 2f446b116b |
203011330411 has 8 divisors (see below), whose sum is σ = 203143752800. Its totient is φ = 202878950400.
The previous prime is 203011330399. The next prime is 203011330421. The reversal of 203011330411 is 114033110302.
203011330411 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 203011330411 - 211 = 203011328363 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (203011330421) 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 7 ways as a sum of consecutive naturals, for example, 21140011 + ... + 21149611.
It is an arithmetic number, because the mean of its divisors is an integer number (25392969100).
Almost surely, 2203011330411 is an apocalyptic number.
203011330411 is a deficient number, since it is larger than the sum of its proper divisors (132422389).
203011330411 is an equidigital number, since it uses as much as digits as its factorization.
203011330411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21189.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 203011330411 its reverse (114033110302), we get a palindrome (317044440713).
The spelling of 203011330411 in words is "two hundred three billion, eleven million, three hundred thirty thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.080 sec. • engine limits •