Base | Representation |
---|---|
bin | 10000001001111101101… |
… | …011111001011110110001 |
3 | 10221010122110101210020011 |
4 | 100021331223321132301 |
5 | 121142202304101001 |
6 | 2210005030014521 |
7 | 143132021116426 |
oct | 20117553713661 |
9 | 3833573353204 |
10 | 1110210222001 |
11 | 3989237aa9a1 |
12 | 15b1bb1a7441 |
13 | 809001bb65a |
14 | 3ba3d50dd4d |
15 | 1dd2c036d51 |
hex | 1027daf97b1 |
1110210222001 has 2 divisors, whose sum is σ = 1110210222002. Its totient is φ = 1110210222000.
The previous prime is 1110210221909. The next prime is 1110210222053. The reversal of 1110210222001 is 1002220120111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 972197972001 + 138012250000 = 986001^2 + 371500^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110210222001 - 211 = 1110210219953 is a prime.
It is not a weakly prime, because it can be changed into another prime (1110210222701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555105111000 + 555105111001.
It is an arithmetic number, because the mean of its divisors is an integer number (555105111001).
Almost surely, 21110210222001 is an apocalyptic number.
It is an amenable number.
1110210222001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110210222001 is an equidigital number, since it uses as much as digits as its factorization.
1110210222001 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 1110210222001 its reverse (1002220120111), we get a palindrome (2112430342112).
The spelling of 1110210222001 in words is "one trillion, one hundred ten billion, two hundred ten million, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •