Base | Representation |
---|---|
bin | 10000001001111000010… |
… | …100000111100101011001 |
3 | 10221010102011211020010222 |
4 | 100021320110013211121 |
5 | 121142011221232413 |
6 | 2205552050245425 |
7 | 143126545114532 |
oct | 20117024074531 |
9 | 3833364736128 |
10 | 1110120102233 |
11 | 39888794764a |
12 | 15b194b86875 |
13 | 808b762704c |
14 | 3ba31571689 |
15 | 1dd24184b08 |
hex | 10278507959 |
1110120102233 has 2 divisors, whose sum is σ = 1110120102234. Its totient is φ = 1110120102232.
The previous prime is 1110120102101. The next prime is 1110120102319. The reversal of 1110120102233 is 3322010210111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 985784879689 + 124335222544 = 992867^2 + 352612^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110120102233 - 232 = 1105825134937 is a prime.
It is not a weakly prime, because it can be changed into another prime (1110120102733) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555060051116 + 555060051117.
It is an arithmetic number, because the mean of its divisors is an integer number (555060051117).
Almost surely, 21110120102233 is an apocalyptic number.
It is an amenable number.
1110120102233 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110120102233 is an equidigital number, since it uses as much as digits as its factorization.
1110120102233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1110120102233 its reverse (3322010210111), we get a palindrome (4432130312344).
The spelling of 1110120102233 in words is "one trillion, one hundred ten billion, one hundred twenty million, one hundred two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •