Base | Representation |
---|---|
bin | 10001110010000100111… |
… | …000011101101001110101 |
3 | 11022211012021210021222221 |
4 | 101302010320131221311 |
5 | 130010124011343401 |
6 | 2333213515122341 |
7 | 154200205343035 |
oct | 21620470355165 |
9 | 4284167707887 |
10 | 1222000106101 |
11 | 43127a225465 |
12 | 1789b94433b1 |
13 | 8b307476078 |
14 | 432062d58c5 |
15 | 21bc133a7a1 |
hex | 11c84e1da75 |
1222000106101 has 2 divisors, whose sum is σ = 1222000106102. Its totient is φ = 1222000106100.
The previous prime is 1222000106099. The next prime is 1222000106137. The reversal of 1222000106101 is 1016010002221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 849717083601 + 372283022500 = 921801^2 + 610150^2 .
It is an emirp because it is prime and its reverse (1016010002221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1222000106101 - 21 = 1222000106099 is a prime.
Together with 1222000106099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1222000106801) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 611000053050 + 611000053051.
It is an arithmetic number, because the mean of its divisors is an integer number (611000053051).
Almost surely, 21222000106101 is an apocalyptic number.
It is an amenable number.
1222000106101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1222000106101 is an equidigital number, since it uses as much as digits as its factorization.
1222000106101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 1222000106101 its reverse (1016010002221), we get a palindrome (2238010108322).
The spelling of 1222000106101 in words is "one trillion, two hundred twenty-two billion, one hundred six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •