Base | Representation |
---|---|
bin | 101111110001010110111000… |
… | …100110000101011110111111 |
3 | 1000112220100212002110222202211 |
4 | 233301112320212011132333 |
5 | 210014234311111210421 |
6 | 2022502340235201251 |
7 | 62153140106513452 |
oct | 5761267046053677 |
9 | 1015810762428684 |
10 | 210100012210111 |
11 | 60a42a07662071 |
12 | 1b692958ba6227 |
13 | 903046661064a |
14 | 39c4c75671499 |
15 | 19452b432e9e1 |
hex | bf15b89857bf |
210100012210111 has 2 divisors, whose sum is σ = 210100012210112. Its totient is φ = 210100012210110.
The previous prime is 210100012210043. The next prime is 210100012210147. The reversal of 210100012210111 is 111012210001012.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210100012210111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 210100012210091 and 210100012210100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210100012213111) 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, 105050006105055 + 105050006105056.
It is an arithmetic number, because the mean of its divisors is an integer number (105050006105056).
Almost surely, 2210100012210111 is an apocalyptic number.
210100012210111 is a deficient number, since it is larger than the sum of its proper divisors (1).
210100012210111 is an equidigital number, since it uses as much as digits as its factorization.
210100012210111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 210100012210111 its reverse (111012210001012), we get a palindrome (321112222211123).
The spelling of 210100012210111 in words is "two hundred ten trillion, one hundred billion, twelve million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •