Base | Representation |
---|---|
bin | 110100101011010001… |
… | …1100011101001100101 |
3 | 101210222121201000120112 |
4 | 1221112203203221211 |
5 | 3323133023430313 |
6 | 123544530142405 |
7 | 11113152165332 |
oct | 1512643435145 |
9 | 353877630515 |
10 | 113121311333 |
11 | 43a7a038558 |
12 | 19b10121a05 |
13 | a88a0771a4 |
14 | 5691967989 |
15 | 2e211508a8 |
hex | 1a568e3a65 |
113121311333 has 2 divisors, whose sum is σ = 113121311334. Its totient is φ = 113121311332.
The previous prime is 113121311297. The next prime is 113121311357. The reversal of 113121311333 is 333113121311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 112129880164 + 991431169 = 334858^2 + 31487^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113121311333 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113121311299 and 113121311308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113121311363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56560655666 + 56560655667.
It is an arithmetic number, because the mean of its divisors is an integer number (56560655667).
Almost surely, 2113121311333 is an apocalyptic number.
It is an amenable number.
113121311333 is a deficient number, since it is larger than the sum of its proper divisors (1).
113121311333 is an equidigital number, since it uses as much as digits as its factorization.
113121311333 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 113121311333 its reverse (333113121311), we get a palindrome (446234432644).
The spelling of 113121311333 in words is "one hundred thirteen billion, one hundred twenty-one million, three hundred eleven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •