Base | Representation |
---|---|
bin | 110000000010010011001111… |
… | …100101101100100010101011 |
3 | 1000201000200011200120101121022 |
4 | 300002103033211230202223 |
5 | 210142323324013334011 |
6 | 2025153254550403055 |
7 | 62333226100460414 |
oct | 6002231745544253 |
9 | 1021020150511538 |
10 | 211264334121131 |
11 | 61351778a63905 |
12 | 1b84053a06048b |
13 | 90b61ab3674a5 |
14 | 3a253695ba80b |
15 | 196570bb948db |
hex | c024cf96c8ab |
211264334121131 has 2 divisors, whose sum is σ = 211264334121132. Its totient is φ = 211264334121130.
The previous prime is 211264334121101. The next prime is 211264334121187. The reversal of 211264334121131 is 131121433462112.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 211264334121131 - 26 = 211264334121067 is a prime.
It is a super-2 number, since 2×2112643341211312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211264334121091 and 211264334121100.
It is not a weakly prime, because it can be changed into another prime (211264334121101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105632167060565 + 105632167060566.
It is an arithmetic number, because the mean of its divisors is an integer number (105632167060566).
Almost surely, 2211264334121131 is an apocalyptic number.
211264334121131 is a deficient number, since it is larger than the sum of its proper divisors (1).
211264334121131 is an equidigital number, since it uses as much as digits as its factorization.
211264334121131 is an evil number, because the sum of its binary digits is even.
The product of its digits is 20736, while the sum is 35.
Adding to 211264334121131 its reverse (131121433462112), we get a palindrome (342385767583243).
The spelling of 211264334121131 in words is "two hundred eleven trillion, two hundred sixty-four billion, three hundred thirty-four million, one hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •