Base | Representation |
---|---|
bin | 101101100001011100010010… |
… | …100100101011111100010110 |
3 | 222020212220112220210200112220 |
4 | 231201130102210223330112 |
5 | 202220221003300010402 |
6 | 1545451145100323210 |
7 | 60112465460626335 |
oct | 5541342244537426 |
9 | 866786486720486 |
10 | 200210212110102 |
11 | 5887a7462a2a67 |
12 | 1a5560b6b43506 |
13 | 879398520294c |
14 | 37623240bdd1c |
15 | 1822dd8d1ddbc |
hex | b6171292bf16 |
200210212110102 has 96 divisors (see below), whose sum is σ = 420256738395648. Its totient is φ = 63580585166208.
The previous prime is 200210212110061. The next prime is 200210212110109. The reversal of 200210212110102 is 201011212012002.
200210212110102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200210212110109) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5214739018 + ... + 5214777410.
It is an arithmetic number, because the mean of its divisors is an integer number (4377674358288).
Almost surely, 2200210212110102 is an apocalyptic number.
200210212110102 is an abundant number, since it is smaller than the sum of its proper divisors (220046526285546).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200210212110102 is a wasteful number, since it uses less digits than its factorization.
200210212110102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44954 (or 44931 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 200210212110102 its reverse (201011212012002), we get a palindrome (401221424122104).
The spelling of 200210212110102 in words is "two hundred trillion, two hundred ten billion, two hundred twelve million, one hundred ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •