Base | Representation |
---|---|
bin | 100000001010011010111… |
… | …001101101110001011110 |
3 | 21211021221110211110010220 |
4 | 200022122321231301132 |
5 | 242203003233323402 |
6 | 4411205105542210 |
7 | 315453054055134 |
oct | 40123271556136 |
9 | 7737843743126 |
10 | 2210212011102 |
11 | 782389073087 |
12 | 2b842b644966 |
13 | 130564472064 |
14 | 78d90d21754 |
15 | 3c75cc3cdbc |
hex | 2029ae6dc5e |
2210212011102 has 8 divisors (see below), whose sum is σ = 4420424022216. Its totient is φ = 736737337032.
The previous prime is 2210212011089. The next prime is 2210212011109. The reversal of 2210212011102 is 2011102120122.
2210212011102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
2210212011102 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2210212011109) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 184184334253 + ... + 184184334264.
It is an arithmetic number, because the mean of its divisors is an integer number (552553002777).
Almost surely, 22210212011102 is an apocalyptic number.
2210212011102 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.
2210212011102 is a wasteful number, since it uses less digits than its factorization.
2210212011102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 368368668522.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2210212011102 its reverse (2011102120122), we get a palindrome (4221314131224).
The spelling of 2210212011102 in words is "two trillion, two hundred ten billion, two hundred twelve million, eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •