Base | Representation |
---|---|
bin | 110000000011000000100100… |
… | …111100111111101001100001 |
3 | 1000201012022211001120121102012 |
4 | 300003000210330333221201 |
5 | 210144123021244313241 |
6 | 2025231505043402305 |
7 | 62336601254523014 |
oct | 6003004474775141 |
9 | 1021168731517365 |
10 | 211313010932321 |
11 | 61370387830591 |
12 | 1b849a63983395 |
13 | 90ba967c4054c |
14 | 3a278662b137b |
15 | 1966b0a2b86eb |
hex | c03024f3fa61 |
211313010932321 has 4 divisors (see below), whose sum is σ = 211313214212100. Its totient is φ = 211312807652544.
The previous prime is 211313010932311. The next prime is 211313010932323. The reversal of 211313010932321 is 123239010313112.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 169017030429025 + 42295980503296 = 13000655^2 + 6503536^2 .
It is a cyclic number.
It is not a de Polignac number, because 211313010932321 - 222 = 211313006738017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211313010932323) 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, 100072556 + ... + 102162333.
It is an arithmetic number, because the mean of its divisors is an integer number (52828303553025).
Almost surely, 2211313010932321 is an apocalyptic number.
It is an amenable number.
211313010932321 is a deficient number, since it is larger than the sum of its proper divisors (203279779).
211313010932321 is a wasteful number, since it uses less digits than its factorization.
211313010932321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203279778.
The product of its (nonzero) digits is 5832, while the sum is 32.
The spelling of 211313010932321 in words is "two hundred eleven trillion, three hundred thirteen billion, ten million, nine hundred thirty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •