Base | Representation |
---|---|
bin | 1011101100110111001… |
… | …0000100100001101001 |
3 | 201012212111101100110211 |
4 | 2323031302010201221 |
5 | 11243142330410013 |
6 | 232203040341121 |
7 | 20344325613316 |
oct | 2731562044151 |
9 | 635774340424 |
10 | 201020950633 |
11 | 782860a4558 |
12 | 32b616147a1 |
13 | 15c579b3389 |
14 | 9a2d923d0d |
15 | 5367de323d |
hex | 2ecdc84869 |
201020950633 has 4 divisors (see below), whose sum is σ = 202488256980. Its totient is φ = 199553644288.
The previous prime is 201020950621. The next prime is 201020950643. The reversal of 201020950633 is 336059020102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 72367456144 + 128653494489 = 269012^2 + 358683^2 .
It is a cyclic number.
It is not a de Polignac number, because 201020950633 - 29 = 201020950121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201020950595 and 201020950604.
It is not an unprimeable number, because it can be changed into a prime (201020950643) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 733652968 + ... + 733653241.
It is an arithmetic number, because the mean of its divisors is an integer number (50622064245).
Almost surely, 2201020950633 is an apocalyptic number.
It is an amenable number.
201020950633 is a deficient number, since it is larger than the sum of its proper divisors (1467306347).
201020950633 is a wasteful number, since it uses less digits than its factorization.
201020950633 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1467306346.
The product of its (nonzero) digits is 9720, while the sum is 31.
Adding to 201020950633 its reverse (336059020102), we get a palindrome (537079970735).
The spelling of 201020950633 in words is "two hundred one billion, twenty million, nine hundred fifty thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •