Base | Representation |
---|---|
bin | 1011101100110111001… |
… | …0000100100001110011 |
3 | 201012212111101100111012 |
4 | 2323031302010201303 |
5 | 11243142330410033 |
6 | 232203040341135 |
7 | 20344325613332 |
oct | 2731562044163 |
9 | 635774340435 |
10 | 201020950643 |
11 | 782860a4567 |
12 | 32b616147ab |
13 | 15c579b3396 |
14 | 9a2d923d19 |
15 | 5367de3248 |
hex | 2ecdc84873 |
201020950643 has 2 divisors, whose sum is σ = 201020950644. Its totient is φ = 201020950642.
The previous prime is 201020950621. The next prime is 201020950661. The reversal of 201020950643 is 346059020102.
It is a happy number.
201020950643 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 is a cyclic number.
It is not a de Polignac number, because 201020950643 - 28 = 201020950387 is a prime.
It is a super-2 number, since 2×2010209506432 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (201020950673) 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, 100510475321 + 100510475322.
It is an arithmetic number, because the mean of its divisors is an integer number (100510475322).
Almost surely, 2201020950643 is an apocalyptic number.
201020950643 is a deficient number, since it is larger than the sum of its proper divisors (1).
201020950643 is an equidigital number, since it uses as much as digits as its factorization.
201020950643 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 32.
Adding to 201020950643 its reverse (346059020102), we get a palindrome (547079970745).
The spelling of 201020950643 in words is "two hundred one billion, twenty million, nine hundred fifty thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •