Base | Representation |
---|---|
bin | 110000000011001001111001… |
… | …000000101011101110010101 |
3 | 1000201020021121222200210000102 |
4 | 300003021321000223232111 |
5 | 210144304011321320041 |
6 | 2025240241234223445 |
7 | 62340404133646133 |
oct | 6003117100535625 |
9 | 1021207558623012 |
10 | 211323011120021 |
11 | 61374649663619 |
12 | 1b84b994a24b85 |
13 | 90bb89c995288 |
14 | 3a28134482753 |
15 | 1966ee31b209b |
hex | c0327902bb95 |
211323011120021 has 16 divisors (see below), whose sum is σ = 230282432246400. Its totient is φ = 193157303572800.
The previous prime is 211323011119999. The next prime is 211323011120047. The reversal of 211323011120021 is 120021110323112.
It is a cyclic number.
It is not a de Polignac number, because 211323011120021 - 230 = 211321937378197 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211323011119975 and 211323011120002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211323011125021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 138097265 + ... + 139619126.
It is an arithmetic number, because the mean of its divisors is an integer number (14392652015400).
Almost surely, 2211323011120021 is an apocalyptic number.
It is an amenable number.
211323011120021 is a deficient number, since it is larger than the sum of its proper divisors (18959421126379).
211323011120021 is a wasteful number, since it uses less digits than its factorization.
211323011120021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277717820.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 211323011120021 its reverse (120021110323112), we get a palindrome (331344121443133).
The spelling of 211323011120021 in words is "two hundred eleven trillion, three hundred twenty-three billion, eleven million, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •