Base | Representation |
---|---|
bin | 110011110010100111… |
… | …0101000100100001001 |
3 | 101122002010001110011112 |
4 | 1213211032220210021 |
5 | 3310234310013113 |
6 | 123032130340105 |
7 | 11015064260531 |
oct | 1474516504411 |
9 | 348063043145 |
10 | 111220001033 |
11 | 43193877a29 |
12 | 1967b42a635 |
13 | a6461a50cb |
14 | 555123c4c1 |
15 | 2d5e2845a8 |
hex | 19e53a8909 |
111220001033 has 2 divisors, whose sum is σ = 111220001034. Its totient is φ = 111220001032.
The previous prime is 111220001023. The next prime is 111220001041. The reversal of 111220001033 is 330100022111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106633596304 + 4586404729 = 326548^2 + 67723^2 .
It is a cyclic number.
It is not a de Polignac number, because 111220001033 - 214 = 111219984649 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 111220000999 and 111220001017.
It is not a weakly prime, because it can be changed into another prime (111220001003) 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, 55610000516 + 55610000517.
It is an arithmetic number, because the mean of its divisors is an integer number (55610000517).
Almost surely, 2111220001033 is an apocalyptic number.
It is an amenable number.
111220001033 is a deficient number, since it is larger than the sum of its proper divisors (1).
111220001033 is an equidigital number, since it uses as much as digits as its factorization.
111220001033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 111220001033 its reverse (330100022111), we get a palindrome (441320023144).
The spelling of 111220001033 in words is "one hundred eleven billion, two hundred twenty million, one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •