Base | Representation |
---|---|
bin | 1100010011101001001… |
… | …0011001111111111101 |
3 | 202012202000021221122021 |
4 | 3010322102121333331 |
5 | 11431002403113432 |
6 | 241044042320141 |
7 | 21163315256341 |
oct | 3047222317775 |
9 | 665660257567 |
10 | 211431301117 |
11 | 817385039a3 |
12 | 34b87ab9051 |
13 | 16c266c738a |
14 | a33a383621 |
15 | 5776d0b697 |
hex | 313a499ffd |
211431301117 has 2 divisors, whose sum is σ = 211431301118. Its totient is φ = 211431301116.
The previous prime is 211431301099. The next prime is 211431301201. The reversal of 211431301117 is 711103134112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 130990429476 + 80440871641 = 361926^2 + 283621^2 .
It is a cyclic number.
It is not a de Polignac number, because 211431301117 - 235 = 177071562749 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 211431301091 and 211431301100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211431305117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105715650558 + 105715650559.
It is an arithmetic number, because the mean of its divisors is an integer number (105715650559).
Almost surely, 2211431301117 is an apocalyptic number.
It is an amenable number.
211431301117 is a deficient number, since it is larger than the sum of its proper divisors (1).
211431301117 is an equidigital number, since it uses as much as digits as its factorization.
211431301117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 25.
Adding to 211431301117 its reverse (711103134112), we get a palindrome (922534435229).
The spelling of 211431301117 in words is "two hundred eleven billion, four hundred thirty-one million, three hundred one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •