Base | Representation |
---|---|
bin | 1011101101010001010… |
… | …1111000110101001101 |
3 | 201020011011110121020022 |
4 | 2323110111320311031 |
5 | 11243404014100323 |
6 | 232222011231525 |
7 | 20350133214320 |
oct | 2732425706515 |
9 | 636134417208 |
10 | 201131003213 |
11 | 783322316a8 |
12 | 32b924485a5 |
13 | 15c7473664a |
14 | 9a403b07b7 |
15 | 53728d14c8 |
hex | 2ed4578d4d |
201131003213 has 16 divisors (see below), whose sum is σ = 235966089216. Its totient is φ = 167847225840.
The previous prime is 201131003167. The next prime is 201131003251. The reversal of 201131003213 is 312300131102.
It is not a de Polignac number, because 201131003213 - 212 = 201130999117 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 201131003191 and 201131003200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201131003113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 980681 + ... + 1167902.
It is an arithmetic number, because the mean of its divisors is an integer number (14747880576).
Almost surely, 2201131003213 is an apocalyptic number.
It is an amenable number.
201131003213 is a deficient number, since it is larger than the sum of its proper divisors (34835086003).
201131003213 is a wasteful number, since it uses less digits than its factorization.
201131003213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2148944.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 201131003213 its reverse (312300131102), we get a palindrome (513431134315).
The spelling of 201131003213 in words is "two hundred one billion, one hundred thirty-one million, three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •