Base | Representation |
---|---|
bin | 10000000000101010010… |
… | …110001111100111110011 |
3 | 10220011212100222201101212 |
4 | 100000222112033213303 |
5 | 121011223324231003 |
6 | 2201233545550335 |
7 | 142326346364153 |
oct | 20005226174763 |
9 | 3804770881355 |
10 | 1100222102003 |
11 | 39466876a572 |
12 | 1592921a53ab |
13 | 7c99ab0068b |
14 | 3b372ba0763 |
15 | 1d945223dd8 |
hex | 1002a58f9f3 |
1100222102003 has 2 divisors, whose sum is σ = 1100222102004. Its totient is φ = 1100222102002.
The previous prime is 1100222101987. The next prime is 1100222102047. The reversal of 1100222102003 is 3002012220011.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1100222102003 - 24 = 1100222101987 is a prime.
It is a super-2 number, since 2×11002221020032 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1100222101003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550111051001 + 550111051002.
It is an arithmetic number, because the mean of its divisors is an integer number (550111051002).
Almost surely, 21100222102003 is an apocalyptic number.
1100222102003 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100222102003 is an equidigital number, since it uses as much as digits as its factorization.
1100222102003 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 1100222102003 its reverse (3002012220011), we get a palindrome (4102234322014).
The spelling of 1100222102003 in words is "one trillion, one hundred billion, two hundred twenty-two million, one hundred two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •