Base | Representation |
---|---|
bin | 10111001111100001110110… |
… | …000011001110001110101001 |
3 | 111101221100101000210201211222 |
4 | 113033201312003032032221 |
5 | 101344302032230413001 |
6 | 1001224121552031425 |
7 | 30350211315165311 |
oct | 2717416603161651 |
9 | 441840330721758 |
10 | 102222202201001 |
11 | 2a631213240403 |
12 | b56b420832575 |
13 | 45066876c650c |
14 | 1b3581c31a441 |
15 | bc4079e9161b |
hex | 5cf8760ce3a9 |
102222202201001 has 2 divisors, whose sum is σ = 102222202201002. Its totient is φ = 102222202201000.
The previous prime is 102222202200961. The next prime is 102222202201003. The reversal of 102222202201001 is 100102202222201.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98805985614400 + 3416216586601 = 9940120^2 + 1848301^2 .
It is a cyclic number.
It is not a de Polignac number, because 102222202201001 - 214 = 102222202184617 is a prime.
Together with 102222202201003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (102222202201003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51111101100500 + 51111101100501.
It is an arithmetic number, because the mean of its divisors is an integer number (51111101100501).
Almost surely, 2102222202201001 is an apocalyptic number.
It is an amenable number.
102222202201001 is a deficient number, since it is larger than the sum of its proper divisors (1).
102222202201001 is an equidigital number, since it uses as much as digits as its factorization.
102222202201001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 102222202201001 its reverse (100102202222201), we get a palindrome (202324404423202).
The spelling of 102222202201001 in words is "one hundred two trillion, two hundred twenty-two billion, two hundred two million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •