Base | Representation |
---|---|
bin | 1011101101010001001… |
… | …1001101101100000101 |
3 | 201020011010010222122100 |
4 | 2323110103031230011 |
5 | 11243403324132323 |
6 | 232221544222313 |
7 | 20350124234511 |
oct | 2732423155405 |
9 | 636133128570 |
10 | 201130302213 |
11 | 783318a2a65 |
12 | 32b9216a999 |
13 | 15c7454c559 |
14 | 9a4026b141 |
15 | 53727e3943 |
hex | 2ed44cdb05 |
201130302213 has 12 divisors (see below), whose sum is σ = 291052672768. Its totient is φ = 133841733480.
The previous prime is 201130302161. The next prime is 201130302223. The reversal of 201130302213 is 312203031102.
201130302213 is a `hidden beast` number, since 20 + 1 + 130 + 302 + 213 = 666.
201130302213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 201130302213 - 222 = 201126107909 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201130302223) 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 in 11 ways as a sum of consecutive naturals, for example, 20422693 + ... + 20432538.
Almost surely, 2201130302213 is an apocalyptic number.
It is an amenable number.
201130302213 is a deficient number, since it is larger than the sum of its proper divisors (89922370555).
201130302213 is a wasteful number, since it uses less digits than its factorization.
201130302213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40855784 (or 40855781 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 201130302213 its reverse (312203031102), we get a palindrome (513333333315).
The spelling of 201130302213 in words is "two hundred one billion, one hundred thirty million, three hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •