Base | Representation |
---|---|
bin | 110100101011100100… |
… | …0111111001010000101 |
3 | 101211000022011112002221 |
4 | 1221113020333022011 |
5 | 3323143031421313 |
6 | 123545520332341 |
7 | 11113331452624 |
oct | 1512710771205 |
9 | 354008145087 |
10 | 113131123333 |
11 | 43a8462a448 |
12 | 19b134740b1 |
13 | a88c1012c7 |
14 | 5692d9d6bb |
15 | 2e21e3cc8d |
hex | 1a5723f285 |
113131123333 has 2 divisors, whose sum is σ = 113131123334. Its totient is φ = 113131123332.
The previous prime is 113131123327. The next prime is 113131123349. The reversal of 113131123333 is 333321131311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102481296129 + 10649827204 = 320127^2 + 103198^2 .
It is a cyclic number.
It is not a de Polignac number, because 113131123333 - 29 = 113131122821 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113131123298 and 113131123307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113131123033) 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, 56565561666 + 56565561667.
It is an arithmetic number, because the mean of its divisors is an integer number (56565561667).
Almost surely, 2113131123333 is an apocalyptic number.
It is an amenable number.
113131123333 is a deficient number, since it is larger than the sum of its proper divisors (1).
113131123333 is an equidigital number, since it uses as much as digits as its factorization.
113131123333 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1458, while the sum is 25.
Adding to 113131123333 its reverse (333321131311), we get a palindrome (446452254644).
The spelling of 113131123333 in words is "one hundred thirteen billion, one hundred thirty-one million, one hundred twenty-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •