Base | Representation |
---|---|
bin | 10000001011110100010… |
… | …110100100100100100001 |
3 | 10221022210012121212220022 |
4 | 100023310112210210201 |
5 | 121210241441320113 |
6 | 2210534345523225 |
7 | 143232244352033 |
oct | 20136426444441 |
9 | 3838705555808 |
10 | 1112201120033 |
11 | 3997555a0073 |
12 | 15b675aa3515 |
13 | 80b597c9b23 |
14 | 3bb8bab9c53 |
15 | 1dde6bec908 |
hex | 102f45a4921 |
1112201120033 has 2 divisors, whose sum is σ = 1112201120034. Its totient is φ = 1112201120032.
The previous prime is 1112201119949. The next prime is 1112201120053. The reversal of 1112201120033 is 3300211022111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 750912368704 + 361288751329 = 866552^2 + 601073^2 .
It is an emirp because it is prime and its reverse (3300211022111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1112201120033 - 236 = 1043481643297 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1112201119993 and 1112201120020.
It is not a weakly prime, because it can be changed into another prime (1112201120053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556100560016 + 556100560017.
It is an arithmetic number, because the mean of its divisors is an integer number (556100560017).
Almost surely, 21112201120033 is an apocalyptic number.
It is an amenable number.
1112201120033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112201120033 is an equidigital number, since it uses as much as digits as its factorization.
1112201120033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1112201120033 its reverse (3300211022111), we get a palindrome (4412412142144).
The spelling of 1112201120033 in words is "one trillion, one hundred twelve billion, two hundred one million, one hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •