Base | Representation |
---|---|
bin | 110011101100001100… |
… | …0001011110111101101 |
3 | 101121112002100211201001 |
4 | 1213120120023313231 |
5 | 3304314111314013 |
6 | 122554505320301 |
7 | 11006535561433 |
oct | 1473030136755 |
9 | 347462324631 |
10 | 111004401133 |
11 | 430930aa59a |
12 | 1961b196091 |
13 | a6106183c2 |
14 | 5530758d53 |
15 | 2d4a397ddd |
hex | 19d860bded |
111004401133 has 2 divisors, whose sum is σ = 111004401134. Its totient is φ = 111004401132.
The previous prime is 111004401127. The next prime is 111004401223. The reversal of 111004401133 is 331104400111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101020994244 + 9983406889 = 317838^2 + 99917^2 .
It is an emirp because it is prime and its reverse (331104400111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111004401133 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 111004401133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111004401103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55502200566 + 55502200567.
It is an arithmetic number, because the mean of its divisors is an integer number (55502200567).
Almost surely, 2111004401133 is an apocalyptic number.
It is an amenable number.
111004401133 is a deficient number, since it is larger than the sum of its proper divisors (1).
111004401133 is an equidigital number, since it uses as much as digits as its factorization.
111004401133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 111004401133 its reverse (331104400111), we get a palindrome (442108801244).
The spelling of 111004401133 in words is "one hundred eleven billion, four million, four hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •