Base | Representation |
---|---|
bin | 101111110010110100001101… |
… | …100100001000101101011000 |
3 | 1000120020221111212220021122012 |
4 | 233302310031210020231120 |
5 | 210022410023313311300 |
6 | 2023020352055045052 |
7 | 62163315311664152 |
oct | 5762641544105530 |
9 | 1016227455807565 |
10 | 210200222010200 |
11 | 60a81460464074 |
12 | 1b6aa265070788 |
13 | 9039a46728c46 |
14 | 39c9a60505ad2 |
15 | 1947bcbbac435 |
hex | bf2d0d908b58 |
210200222010200 has 48 divisors (see below), whose sum is σ = 509964016888080. Its totient is φ = 80424432767360.
The previous prime is 210200222010133. The next prime is 210200222010239. The reversal of 210200222010200 is 2010222002012.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 22847845619 + ... + 22847854818.
It is an arithmetic number, because the mean of its divisors is an integer number (10624250351835).
Almost surely, 2210200222010200 is an apocalyptic number.
210200222010200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210200222010200 is an abundant number, since it is smaller than the sum of its proper divisors (299763794877880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210200222010200 is a wasteful number, since it uses less digits than its factorization.
210200222010200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45695700476 (or 45695700467 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 210200222010200 its reverse (2010222002012), we get a palindrome (212210444012212).
The spelling of 210200222010200 in words is "two hundred ten trillion, two hundred billion, two hundred twenty-two million, ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •