Base | Representation |
---|---|
bin | 110000000001011010010100… |
… | …111110111001100010111111 |
3 | 1000200210211102122001221112212 |
4 | 300001122110332321202333 |
5 | 210140323144130030421 |
6 | 2025105230451251035 |
7 | 62325633466354133 |
oct | 6001322476714277 |
9 | 1020724378057485 |
10 | 211203221330111 |
11 | 6132886842544a |
12 | 1b8307235a9a7b |
13 | 90b04bc1cb59a |
14 | 3a2240d0193c3 |
15 | 1963d318d0e5b |
hex | c01694fb98bf |
211203221330111 has 8 divisors (see below), whose sum is σ = 218017628160000. Its totient is φ = 204388901980920.
The previous prime is 211203221330027. The next prime is 211203221330137. The reversal of 211203221330111 is 111033122302112.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211203221330111 - 214 = 211203221313727 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211203221339111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16946111 + ... + 26637888.
It is an arithmetic number, because the mean of its divisors is an integer number (27252203520000).
Almost surely, 2211203221330111 is an apocalyptic number.
211203221330111 is a deficient number, since it is larger than the sum of its proper divisors (6814406829889).
211203221330111 is a wasteful number, since it uses less digits than its factorization.
211203221330111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43740349.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 211203221330111 its reverse (111033122302112), we get a palindrome (322236343632223).
The spelling of 211203221330111 in words is "two hundred eleven trillion, two hundred three billion, two hundred twenty-one million, three hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •