Base | Representation |
---|---|
bin | 101111110000000100000110… |
… | …010101101001110101111101 |
3 | 1000112120212102012021020021202 |
4 | 233300010012111221311331 |
5 | 210011310234241242341 |
6 | 2022353435550105245 |
7 | 62143542246141611 |
oct | 5760040625516575 |
9 | 1015525365236252 |
10 | 210011122212221 |
11 | 60a09242567aa0 |
12 | 1b67968baab225 |
13 | 9024c6b761865 |
14 | 39c0841d57341 |
15 | 1942d1066279b |
hex | bf0106569d7d |
210011122212221 has 64 divisors (see below), whose sum is σ = 237639627574272. Its totient is φ = 183941591040000.
The previous prime is 210011122212211. The next prime is 210011122212223. The reversal of 210011122212221 is 122212221110012.
It is a cyclic number.
It is not a de Polignac number, because 210011122212221 - 210 = 210011122211197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 210011122212193 and 210011122212202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210011122212223) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6534040811 + ... + 6534072951.
It is an arithmetic number, because the mean of its divisors is an integer number (3713119180848).
Almost surely, 2210011122212221 is an apocalyptic number.
It is an amenable number.
210011122212221 is a deficient number, since it is larger than the sum of its proper divisors (27628505362051).
210011122212221 is a wasteful number, since it uses less digits than its factorization.
210011122212221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32934.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 210011122212221 its reverse (122212221110012), we get a palindrome (332223343322233).
The spelling of 210011122212221 in words is "two hundred ten trillion, eleven billion, one hundred twenty-two million, two hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •