Base | Representation |
---|---|
bin | 11110000100010100101… |
… | …01110000110111111111 |
3 | 10122202122102120210202221 |
4 | 33002022111300313333 |
5 | 113411303424041223 |
6 | 2110334451230211 |
7 | 134432335363234 |
oct | 17021225606777 |
9 | 3582572523687 |
10 | 1033113112063 |
11 | 36916046710a |
12 | 1482835a8367 |
13 | 765645c9b86 |
14 | 380080dd78b |
15 | 1bd18828b5d |
hex | f08a570dff |
1033113112063 has 2 divisors, whose sum is σ = 1033113112064. Its totient is φ = 1033113112062.
The previous prime is 1033113112019. The next prime is 1033113112081. The reversal of 1033113112063 is 3602113113301.
It is a strong prime.
It is an emirp because it is prime and its reverse (3602113113301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1033113112063 - 221 = 1033111014911 is a prime.
It is a super-2 number, since 2×10331131120632 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1033113112363) 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, 516556556031 + 516556556032.
It is an arithmetic number, because the mean of its divisors is an integer number (516556556032).
Almost surely, 21033113112063 is an apocalyptic number.
1033113112063 is a deficient number, since it is larger than the sum of its proper divisors (1).
1033113112063 is an equidigital number, since it uses as much as digits as its factorization.
1033113112063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 1033113112063 its reverse (3602113113301), we get a palindrome (4635226225364).
The spelling of 1033113112063 in words is "one trillion, thirty-three billion, one hundred thirteen million, one hundred twelve thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •