Base | Representation |
---|---|
bin | 10110110010011011000111… |
… | …111011101111010001101011 |
3 | 111010212010210221120011110202 |
4 | 112302123013323233101223 |
5 | 101114014401012222422 |
6 | 553053223515102415 |
7 | 30052544410241606 |
oct | 2662330773572153 |
9 | 433763727504422 |
10 | 100222121210987 |
11 | 29a2aa65702626 |
12 | b2a7875741a0b |
13 | 43bcba0446279 |
14 | 1aa6ac2bc733d |
15 | b8c019d16b92 |
hex | 5b26c7eef46b |
100222121210987 has 2 divisors, whose sum is σ = 100222121210988. Its totient is φ = 100222121210986.
The previous prime is 100222121210927. The next prime is 100222121211013. The reversal of 100222121210987 is 789012121222001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100222121210987 - 210 = 100222121209963 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100222121210987.
It is not a weakly prime, because it can be changed into another prime (100222121210927) 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, 50111060605493 + 50111060605494.
It is an arithmetic number, because the mean of its divisors is an integer number (50111060605494).
Almost surely, 2100222121210987 is an apocalyptic number.
100222121210987 is a deficient number, since it is larger than the sum of its proper divisors (1).
100222121210987 is an equidigital number, since it uses as much as digits as its factorization.
100222121210987 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 38.
Adding to 100222121210987 its reverse (789012121222001), we get a palindrome (889234242432988).
The spelling of 100222121210987 in words is "one hundred trillion, two hundred twenty-two billion, one hundred twenty-one million, two hundred ten thousand, nine hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •