Base | Representation |
---|---|
bin | 1100011001100100001… |
… | …1000010111100000110 |
3 | 202100211210210121110120 |
4 | 3012121003002330012 |
5 | 11442231401010042 |
6 | 241505513402410 |
7 | 21250601362620 |
oct | 3063103027406 |
9 | 670753717416 |
10 | 213021110022 |
11 | 82383954956 |
12 | 35350409406 |
13 | 1711aba25c6 |
14 | a44b583c10 |
15 | 581b695dec |
hex | 31990c2f06 |
213021110022 has 64 divisors (see below), whose sum is σ = 504173030400. Its totient is φ = 58708702080.
The previous prime is 213021110009. The next prime is 213021110023. The reversal of 213021110022 is 220011120312.
It is a junction number, because it is equal to n+sod(n) for n = 213021109983 and 213021110010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213021110023) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1209879 + ... + 1374717.
It is an arithmetic number, because the mean of its divisors is an integer number (7877703600).
Almost surely, 2213021110022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 213021110022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (252086515200).
213021110022 is an abundant number, since it is smaller than the sum of its proper divisors (291151920378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213021110022 is a wasteful number, since it uses less digits than its factorization.
213021110022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 165941.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 213021110022 its reverse (220011120312), we get a palindrome (433032230334).
The spelling of 213021110022 in words is "two hundred thirteen billion, twenty-one million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •