Base | Representation |
---|---|
bin | 11001000010001100011111… |
… | …110110100010000100110001 |
3 | 112102211122120011002200100111 |
4 | 121002030133312202010301 |
5 | 103412402414340201001 |
6 | 1030100100432221321 |
7 | 32122415502063511 |
oct | 3102143766420461 |
9 | 472748504080314 |
10 | 110102021022001 |
11 | 3209a006571008 |
12 | 1042261409a841 |
13 | 49587647088b8 |
14 | 1d28d7556d841 |
15 | cae0160b3851 |
hex | 64231fda2131 |
110102021022001 has 2 divisors, whose sum is σ = 110102021022002. Its totient is φ = 110102021022000.
The previous prime is 110102021021963. The next prime is 110102021022023. The reversal of 110102021022001 is 100220120201011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90551686698225 + 19550334323776 = 9515865^2 + 4421576^2 .
It is a cyclic number.
It is not a de Polignac number, because 110102021022001 - 235 = 110067661283633 is a prime.
It is not a weakly prime, because it can be changed into another prime (110102021022031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55051010511000 + 55051010511001.
It is an arithmetic number, because the mean of its divisors is an integer number (55051010511001).
Almost surely, 2110102021022001 is an apocalyptic number.
It is an amenable number.
110102021022001 is a deficient number, since it is larger than the sum of its proper divisors (1).
110102021022001 is an equidigital number, since it uses as much as digits as its factorization.
110102021022001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110102021022001 its reverse (100220120201011), we get a palindrome (210322141223012).
The spelling of 110102021022001 in words is "one hundred ten trillion, one hundred two billion, twenty-one million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •