Base | Representation |
---|---|
bin | 101101100001011110001001… |
… | …101010011010101101101110 |
3 | 222020220002201011101010221120 |
4 | 231201132021222122231232 |
5 | 202220234101241213402 |
6 | 1545452115232241410 |
7 | 60112566131363103 |
oct | 5541361152325556 |
9 | 866802634333846 |
10 | 200212210101102 |
11 | 588805810981a1 |
12 | 1a5565740a0266 |
13 | 8793c13125744 |
14 | 37624735b4aaa |
15 | 1822ea44363bc |
hex | b61789a9ab6e |
200212210101102 has 8 divisors (see below), whose sum is σ = 400424420202216. Its totient is φ = 66737403367032.
The previous prime is 200212210101019. The next prime is 200212210101121. The reversal of 200212210101102 is 201101012212002.
It is a sphenic number, since it is the product of 3 distinct primes.
200212210101102 is an admirable number.
It is a super-2 number, since 2×2002122101011022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16684350841753 + ... + 16684350841764.
It is an arithmetic number, because the mean of its divisors is an integer number (50053052525277).
Almost surely, 2200212210101102 is an apocalyptic number.
200212210101102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200212210101102 is a wasteful number, since it uses less digits than its factorization.
200212210101102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33368701683522.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 200212210101102 its reverse (201101012212002), we get a palindrome (401313222313104).
The spelling of 200212210101102 in words is "two hundred trillion, two hundred twelve billion, two hundred ten million, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •