Base | Representation |
---|---|
bin | 10000001001110001110… |
… | …000111101010111010001 |
3 | 10221010010112001201211221 |
4 | 100021301300331113101 |
5 | 121141300104101113 |
6 | 2205533123205041 |
7 | 143124042132226 |
oct | 20116160752721 |
9 | 3833115051757 |
10 | 1110010222033 |
11 | 398830917a69 |
12 | 15b164216781 |
13 | 8089a93438b |
14 | 3ba20b2b94d |
15 | 1dd196cc98d |
hex | 10271c3d5d1 |
1110010222033 has 2 divisors, whose sum is σ = 1110010222034. Its totient is φ = 1110010222032.
The previous prime is 1110010221973. The next prime is 1110010222051. The reversal of 1110010222033 is 3302220100111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 977027471809 + 132982750224 = 988447^2 + 364668^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110010222033 - 229 = 1109473351121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1110010221998 and 1110010222016.
It is not a weakly prime, because it can be changed into another prime (1110010222333) 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, 555005111016 + 555005111017.
It is an arithmetic number, because the mean of its divisors is an integer number (555005111017).
Almost surely, 21110010222033 is an apocalyptic number.
It is an amenable number.
1110010222033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110010222033 is an equidigital number, since it uses as much as digits as its factorization.
1110010222033 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 16.
Adding to 1110010222033 its reverse (3302220100111), we get a palindrome (4412230322144).
The spelling of 1110010222033 in words is "one trillion, one hundred ten billion, ten million, two hundred twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •