Base | Representation |
---|---|
bin | 101110001010101100011100… |
… | …010010011110100111000101 |
3 | 222121220220202220001111210011 |
4 | 232022230130102132213011 |
5 | 203103142232200240141 |
6 | 1555501335422230221 |
7 | 60524343465234013 |
oct | 5612543422364705 |
9 | 877826686044704 |
10 | 203045053524421 |
11 | 59772a18382829 |
12 | 1a9335a9725371 |
13 | 893b0b2b20574 |
14 | 381d60c31d8b3 |
15 | 1871a03c95881 |
hex | b8ab1c49e9c5 |
203045053524421 has 2 divisors, whose sum is σ = 203045053524422. Its totient is φ = 203045053524420.
The previous prime is 203045053524373. The next prime is 203045053524431. The reversal of 203045053524421 is 124425350540302.
203045053524421 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 132434409240225 + 70610644284196 = 11508015^2 + 8403014^2 .
It is a cyclic number.
It is not a de Polignac number, because 203045053524421 - 213 = 203045053516229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (203045053524431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101522526762210 + 101522526762211.
It is an arithmetic number, because the mean of its divisors is an integer number (101522526762211).
Almost surely, 2203045053524421 is an apocalyptic number.
It is an amenable number.
203045053524421 is a deficient number, since it is larger than the sum of its proper divisors (1).
203045053524421 is an equidigital number, since it uses as much as digits as its factorization.
203045053524421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576000, while the sum is 40.
The spelling of 203045053524421 in words is "two hundred three trillion, forty-five billion, fifty-three million, five hundred twenty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •