Base | Representation |
---|---|
bin | 101101100000001000011101… |
… | …100100001011001010101101 |
3 | 222020120022012222022002210200 |
4 | 231200020131210023022231 |
5 | 202212232133231241023 |
6 | 1545341541324024113 |
7 | 60103131111256356 |
oct | 5540103544131255 |
9 | 866508188262720 |
10 | 200120202212013 |
11 | 58845557031336 |
12 | 1a540776992039 |
13 | 878833c326315 |
14 | 375bc25b66d2d |
15 | 18208bbb89743 |
hex | b6021d90b2ad |
200120202212013 has 24 divisors (see below), whose sum is σ = 291951397204896. Its totient is φ = 132080380812000.
The previous prime is 200120202212009. The next prime is 200120202212027. The reversal of 200120202212013 is 310212202021002.
200120202212013 is a `hidden beast` number, since 200 + 1 + 20 + 20 + 221 + 201 + 3 = 666.
It is not a de Polignac number, because 200120202212013 - 22 = 200120202212009 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200120202212713) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 251383 + ... + 20007588.
It is an arithmetic number, because the mean of its divisors is an integer number (12164641550204).
Almost surely, 2200120202212013 is an apocalyptic number.
It is an amenable number.
200120202212013 is a deficient number, since it is larger than the sum of its proper divisors (91831194992883).
200120202212013 is a wasteful number, since it uses less digits than its factorization.
200120202212013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20269945 (or 20269942 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 200120202212013 its reverse (310212202021002), we get a palindrome (510332404233015).
The spelling of 200120202212013 in words is "two hundred trillion, one hundred twenty billion, two hundred two million, two hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •