Base | Representation |
---|---|
bin | 110011110010011010… |
… | …0011011110101001101 |
3 | 101122001122010112011212 |
4 | 1213210310123311031 |
5 | 3310231030230013 |
6 | 123031323224205 |
7 | 11014652014514 |
oct | 1474464336515 |
9 | 348048115155 |
10 | 111213133133 |
11 | 4318aa06a83 |
12 | 19679078065 |
13 | a64493c06b |
14 | 555037167b |
15 | 2d5d8796a8 |
hex | 19e4d1bd4d |
111213133133 has 2 divisors, whose sum is σ = 111213133134. Its totient is φ = 111213133132.
The previous prime is 111213133111. The next prime is 111213133139. The reversal of 111213133133 is 331331312111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86329017124 + 24884116009 = 293818^2 + 157747^2 .
It is a cyclic number.
It is not a de Polignac number, because 111213133133 - 210 = 111213132109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111213133099 and 111213133108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111213133139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55606566566 + 55606566567.
It is an arithmetic number, because the mean of its divisors is an integer number (55606566567).
Almost surely, 2111213133133 is an apocalyptic number.
It is an amenable number.
111213133133 is a deficient number, since it is larger than the sum of its proper divisors (1).
111213133133 is an equidigital number, since it uses as much as digits as its factorization.
111213133133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 486, while the sum is 23.
Adding to 111213133133 its reverse (331331312111), we get a palindrome (442544445244).
The spelling of 111213133133 in words is "one hundred eleven billion, two hundred thirteen million, one hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •