Base | Representation |
---|---|
bin | 101101100001011100000110… |
… | …000011001011100011101001 |
3 | 222020212220000021102222211011 |
4 | 231201130012003023203221 |
5 | 202220220041003000410 |
6 | 1545451112153103521 |
7 | 60112460330003626 |
oct | 5541340603134351 |
9 | 866786007388734 |
10 | 200210002000105 |
11 | 5887a648735239 |
12 | 1a5560586b7ba1 |
13 | 87939508189c6 |
14 | 376230422934d |
15 | 1822dc566918a |
hex | b617060cb8e9 |
200210002000105 has 8 divisors (see below), whose sum is σ = 242085987152064. Its totient is φ = 158945345098800.
The previous prime is 200210002000067. The next prime is 200210002000121. The reversal of 200210002000105 is 501000200012002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200210002000105 - 211 = 200210001998057 is a prime.
It is a super-3 number, since 3×2002100020001053 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 152832061941 + ... + 152832063250.
It is an arithmetic number, because the mean of its divisors is an integer number (30260748394008).
Almost surely, 2200210002000105 is an apocalyptic number.
It is an amenable number.
200210002000105 is a deficient number, since it is larger than the sum of its proper divisors (41875985151959).
200210002000105 is a wasteful number, since it uses less digits than its factorization.
200210002000105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 305664125327.
The product of its (nonzero) digits is 40, while the sum is 13.
Adding to 200210002000105 its reverse (501000200012002), we get a palindrome (701210202012107).
The spelling of 200210002000105 in words is "two hundred trillion, two hundred ten billion, two million, one hundred five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •