Base | Representation |
---|---|
bin | 1100010011011010100… |
… | …0101100110011011001 |
3 | 202012120202000101022012 |
4 | 3010312220230303121 |
5 | 11430341212131231 |
6 | 241034013235305 |
7 | 21161642444204 |
oct | 3046650546331 |
9 | 665522011265 |
10 | 211370036441 |
11 | 81706969933 |
12 | 34b6b492b35 |
13 | 16c16ac68a5 |
14 | a33219693b |
15 | 5771758e2b |
hex | 3136a2ccd9 |
211370036441 has 2 divisors, whose sum is σ = 211370036442. Its totient is φ = 211370036440.
The previous prime is 211370036417. The next prime is 211370036489. The reversal of 211370036441 is 144630073112.
211370036441 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 202684542025 + 8685494416 = 450205^2 + 93196^2 .
It is a cyclic number.
It is not a de Polignac number, because 211370036441 - 26 = 211370036377 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 211370036398 and 211370036407.
It is not a weakly prime, because it can be changed into another prime (211370036411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105685018220 + 105685018221.
It is an arithmetic number, because the mean of its divisors is an integer number (105685018221).
Almost surely, 2211370036441 is an apocalyptic number.
It is an amenable number.
211370036441 is a deficient number, since it is larger than the sum of its proper divisors (1).
211370036441 is an equidigital number, since it uses as much as digits as its factorization.
211370036441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12096, while the sum is 32.
The spelling of 211370036441 in words is "two hundred eleven billion, three hundred seventy million, thirty-six thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •