Base | Representation |
---|---|
bin | 1011101011000001… |
… | …0101000000011101 |
3 | 22002100201122002112 |
4 | 2322300111000131 |
5 | 22404101344013 |
6 | 1234524003405 |
7 | 140434011434 |
oct | 27260250035 |
9 | 8070648075 |
10 | 3133231133 |
11 | 1368699a1a |
12 | 735390565 |
13 | 3ac191926 |
14 | 21a1a811b |
15 | 13510eba8 |
hex | bac1501d |
3133231133 has 2 divisors, whose sum is σ = 3133231134. Its totient is φ = 3133231132.
The previous prime is 3133231091. The next prime is 3133231141. The reversal of 3133231133 is 3311323313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2048648644 + 1084582489 = 45262^2 + 32933^2 .
It is an emirp because it is prime and its reverse (3311323313) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3133231133 - 26 = 3133231069 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3133231099 and 3133231108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3133231183) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1566615566 + 1566615567.
It is an arithmetic number, because the mean of its divisors is an integer number (1566615567).
Almost surely, 23133231133 is an apocalyptic number.
It is an amenable number.
3133231133 is a deficient number, since it is larger than the sum of its proper divisors (1).
3133231133 is an equidigital number, since it uses as much as digits as its factorization.
3133231133 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1458, while the sum is 23.
The square root of 3133231133 is about 55975.2725138520. The cubic root of 3133231133 is about 1463.2913692867.
Adding to 3133231133 its reverse (3311323313), we get a palindrome (6444554446).
The spelling of 3133231133 in words is "three billion, one hundred thirty-three million, two hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •