Base | Representation |
---|---|
bin | 10000011101010110110… |
… | …101101011010001111011 |
3 | 11000010101122201021101212 |
4 | 100131112311223101323 |
5 | 122012324011412311 |
6 | 2223331201033335 |
7 | 144500026340651 |
oct | 20352665532173 |
9 | 4003348637355 |
10 | 1131033310331 |
11 | 3a67398aa401 |
12 | 16325092584b |
13 | 8286b2711b2 |
14 | 3ca56c50dd1 |
15 | 1e64a18ac8b |
hex | 10756d6b47b |
1131033310331 has 2 divisors, whose sum is σ = 1131033310332. Its totient is φ = 1131033310330.
The previous prime is 1131033310327. The next prime is 1131033310361. The reversal of 1131033310331 is 1330133301311.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1131033310331 - 22 = 1131033310327 is a prime.
It is a super-2 number, since 2×11310333103312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1131033310297 and 1131033310306.
It is not a weakly prime, because it can be changed into another prime (1131033310361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 565516655165 + 565516655166.
It is an arithmetic number, because the mean of its divisors is an integer number (565516655166).
Almost surely, 21131033310331 is an apocalyptic number.
1131033310331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1131033310331 is an equidigital number, since it uses as much as digits as its factorization.
1131033310331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 729, while the sum is 23.
Adding to 1131033310331 its reverse (1330133301311), we get a palindrome (2461166611642).
The spelling of 1131033310331 in words is "one trillion, one hundred thirty-one billion, thirty-three million, three hundred ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •