Base | Representation |
---|---|
bin | 110000000001100001101010… |
… | …101001110101111111100011 |
3 | 1000200211120202210020211120001 |
4 | 300001201222221311333203 |
5 | 210140440313340231201 |
6 | 2025113012414200431 |
7 | 62326332660333151 |
oct | 6001415251657743 |
9 | 1020746683224501 |
10 | 211211101102051 |
11 | 61331141345766 |
12 | 1b8321624b3117 |
13 | 90b1176867a2b |
14 | 3a229597483d1 |
15 | 196414357d301 |
hex | c0186aa75fe3 |
211211101102051 has 2 divisors, whose sum is σ = 211211101102052. Its totient is φ = 211211101102050.
The previous prime is 211211101101989. The next prime is 211211101102091. The reversal of 211211101102051 is 150201101112112.
211211101102051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 211211101102051 - 213 = 211211101093859 is a prime.
It is a super-2 number, since 2×2112111011020512 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (211211101102091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105605550551025 + 105605550551026.
It is an arithmetic number, because the mean of its divisors is an integer number (105605550551026).
Almost surely, 2211211101102051 is an apocalyptic number.
211211101102051 is a deficient number, since it is larger than the sum of its proper divisors (1).
211211101102051 is an equidigital number, since it uses as much as digits as its factorization.
211211101102051 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 40, while the sum is 19.
Adding to 211211101102051 its reverse (150201101112112), we get a palindrome (361412202214163).
The spelling of 211211101102051 in words is "two hundred eleven trillion, two hundred eleven billion, one hundred one million, one hundred two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •