Base | Representation |
---|---|
bin | 1011101110010010001… |
… | …1101000110100101001 |
3 | 201020212010100122211011 |
4 | 2323210203220310221 |
5 | 11244433134334423 |
6 | 232305010103521 |
7 | 20356645422466 |
oct | 2734443506451 |
9 | 636763318734 |
10 | 201403043113 |
11 | 78461849268 |
12 | 3304957aba1 |
13 | 15cb8bc4abc |
14 | 9a6858666d |
15 | 538b71ab0d |
hex | 2ee48e8d29 |
201403043113 has 2 divisors, whose sum is σ = 201403043114. Its totient is φ = 201403043112.
The previous prime is 201403043087. The next prime is 201403043147. The reversal of 201403043113 is 311340304102.
201403043113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 198962386704 + 2440656409 = 446052^2 + 49403^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201403043113 is a prime.
It is not a weakly prime, because it can be changed into another prime (201403043183) 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 as a sum of consecutive naturals, namely, 100701521556 + 100701521557.
It is an arithmetic number, because the mean of its divisors is an integer number (100701521557).
Almost surely, 2201403043113 is an apocalyptic number.
It is an amenable number.
201403043113 is a deficient number, since it is larger than the sum of its proper divisors (1).
201403043113 is an equidigital number, since it uses as much as digits as its factorization.
201403043113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 201403043113 its reverse (311340304102), we get a palindrome (512743347215).
The spelling of 201403043113 in words is "two hundred one billion, four hundred three million, forty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •