Base | Representation |
---|---|
bin | 101101011111110101110110… |
… | …000111011011011000101101 |
3 | 222020111101121220002112100221 |
4 | 231133311312013123120231 |
5 | 202211420214012341023 |
6 | 1545324434022051341 |
7 | 60101522550003346 |
oct | 5537656607333055 |
9 | 866441556075327 |
10 | 200100213012013 |
11 | 58838029709536 |
12 | 1a538918579b51 |
13 | 87864a4c60422 |
14 | 375ac8b0930cd |
15 | 18200ebd5385d |
hex | b5fd761db62d |
200100213012013 has 32 divisors (see below), whose sum is σ = 216285246858240. Its totient is φ = 184502712176640.
The previous prime is 200100213011983. The next prime is 200100213012043. The reversal of 200100213012013 is 310210312001002.
It is an interprime number because it is at equal distance from previous prime (200100213011983) and next prime (200100213012043).
It is a cyclic number.
It is not a de Polignac number, because 200100213012013 - 217 = 200100212880941 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 (200100213012043) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7925689956 + ... + 7925715202.
It is an arithmetic number, because the mean of its divisors is an integer number (6758913964320).
Almost surely, 2200100213012013 is an apocalyptic number.
It is an amenable number.
200100213012013 is a deficient number, since it is larger than the sum of its proper divisors (16185033846227).
200100213012013 is a wasteful number, since it uses less digits than its factorization.
200100213012013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49237.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 200100213012013 its reverse (310210312001002), we get a palindrome (510310525013015).
The spelling of 200100213012013 in words is "two hundred trillion, one hundred billion, two hundred thirteen million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •