Base | Representation |
---|---|
bin | 11110100100101101011… |
… | …011100111011111111111 |
3 | 21102212001101110112210101 |
4 | 132210231123213133333 |
5 | 233410322303102033 |
6 | 4245104151421531 |
7 | 304535524504405 |
oct | 36445533473777 |
9 | 7385041415711 |
10 | 2101001222143 |
11 | 7400364649aa |
12 | 29b2310848a7 |
13 | 12317b61b345 |
14 | 73990899475 |
15 | 399ba08a97d |
hex | 1e92d6e77ff |
2101001222143 has 2 divisors, whose sum is σ = 2101001222144. Its totient is φ = 2101001222142.
The previous prime is 2101001222071. The next prime is 2101001222147. The reversal of 2101001222143 is 3412221001012.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2101001222143 - 217 = 2101001091071 is a prime.
It is a super-2 number, since 2×21010012221432 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2101001222143.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2101001222147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050500611071 + 1050500611072.
It is an arithmetic number, because the mean of its divisors is an integer number (1050500611072).
Almost surely, 22101001222143 is an apocalyptic number.
2101001222143 is a deficient number, since it is larger than the sum of its proper divisors (1).
2101001222143 is an equidigital number, since it uses as much as digits as its factorization.
2101001222143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 2101001222143 its reverse (3412221001012), we get a palindrome (5513222223155).
The spelling of 2101001222143 in words is "two trillion, one hundred one billion, one million, two hundred twenty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •