Base | Representation |
---|---|
bin | 101111110011000111101111… |
… | …111100111001101010111000 |
3 | 1000120022221122212201201010121 |
4 | 233303013233330321222320 |
5 | 210023231004201202300 |
6 | 2023034141442423024 |
7 | 62164660211103043 |
oct | 5763075774715270 |
9 | 1016287585651117 |
10 | 210221200022200 |
11 | 60a8a345a58a74 |
12 | 1b6b233a661a74 |
13 | 903ba0a9127b3 |
14 | 39caa90653c5a |
15 | 194850871481a |
hex | bf31eff39ab8 |
210221200022200 has 48 divisors (see below), whose sum is σ = 488777204850480. Its totient is φ = 84086258108160.
The previous prime is 210221200022191. The next prime is 210221200022219. The reversal of 210221200022200 is 2220002122012.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6288532 + ... + 21447331.
It is an arithmetic number, because the mean of its divisors is an integer number (10182858434385).
Almost surely, 2210221200022200 is an apocalyptic number.
210221200022200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210221200022200 is an abundant number, since it is smaller than the sum of its proper divisors (278556004828280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210221200022200 is a wasteful number, since it uses less digits than its factorization.
210221200022200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27773776 (or 27773767 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 210221200022200 its reverse (2220002122012), we get a palindrome (212441202144212).
The spelling of 210221200022200 in words is "two hundred ten trillion, two hundred twenty-one billion, two hundred million, twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •