Base | Representation |
---|---|
bin | 1011101100111100011… |
… | …1011100010001010101 |
3 | 201012221001111100101012 |
4 | 2323033013130101111 |
5 | 11243214043031013 |
6 | 232205200142005 |
7 | 20345020052552 |
oct | 2731707342125 |
9 | 635831440335 |
10 | 201043330133 |
11 | 7829779a608 |
12 | 32b69007905 |
13 | 15c5c51a899 |
14 | 9a328aba29 |
15 | 5369d641a8 |
hex | 2ecf1dc455 |
201043330133 has 6 divisors (see below), whose sum is σ = 203835080034. Its totient is φ = 198289306656.
The previous prime is 201043330109. The next prime is 201043330139. The reversal of 201043330133 is 331033340102.
It can be written as a sum of positive squares in 3 ways, for example, as 9639705124 + 191403625009 = 98182^2 + 437497^2 .
It is not a de Polignac number, because 201043330133 - 214 = 201043313749 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201043330099 and 201043330108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201043330139) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 18857810 + ... + 18868467.
It is an arithmetic number, because the mean of its divisors is an integer number (33972513339).
Almost surely, 2201043330133 is an apocalyptic number.
It is an amenable number.
201043330133 is a deficient number, since it is larger than the sum of its proper divisors (2791749901).
201043330133 is an frugal number, since it uses more digits than its factorization.
201043330133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37726423 (or 37726350 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 201043330133 its reverse (331033340102), we get a palindrome (532076670235).
The spelling of 201043330133 in words is "two hundred one billion, forty-three million, three hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •