Base | Representation |
---|---|
bin | 101101100001011100001101… |
… | …001101000001100011110110 |
3 | 222020212220022122021200200120 |
4 | 231201130031031001203312 |
5 | 202220220312214133420 |
6 | 1545451132121352410 |
7 | 60112463315113245 |
oct | 5541341515014366 |
9 | 866786278250616 |
10 | 200210122021110 |
11 | 5887a6aa460853 |
12 | 1a556090938706 |
13 | 879396c64c356 |
14 | 376231614c95c |
15 | 1822dd0e75d40 |
hex | b6170d3418f6 |
200210122021110 has 32 divisors (see below), whose sum is σ = 480523558740480. Its totient is φ = 53387225217888.
The previous prime is 200210122021099. The next prime is 200210122021163. The reversal of 200210122021110 is 11120221012002.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 200210122021110.
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 15 ways as a sum of consecutive naturals, for example, 133030140 + ... + 134526719.
It is an arithmetic number, because the mean of its divisors is an integer number (15016361210640).
Almost surely, 2200210122021110 is an apocalyptic number.
200210122021110 is an abundant number, since it is smaller than the sum of its proper divisors (280313436719370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200210122021110 is a wasteful number, since it uses less digits than its factorization.
200210122021110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267581812.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 200210122021110 its reverse (11120221012002), we get a palindrome (211330343033112).
The spelling of 200210122021110 in words is "two hundred trillion, two hundred ten billion, one hundred twenty-two million, twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •