Base | Representation |
---|---|
bin | 11110000000110010001… |
… | …01110101111111110011 |
3 | 10122120202000101212111112 |
4 | 33000121011311333303 |
5 | 113343411024111311 |
6 | 2105422135503535 |
7 | 134334264560312 |
oct | 17003105657763 |
9 | 3576660355445 |
10 | 1031213113331 |
11 | 368375a11a25 |
12 | 147a33227bab |
13 | 76320a96a7b |
14 | 37ca7a36279 |
15 | 1bc56b1b28b |
hex | f019175ff3 |
1031213113331 has 2 divisors, whose sum is σ = 1031213113332. Its totient is φ = 1031213113330.
The previous prime is 1031213113327. The next prime is 1031213113361. The reversal of 1031213113331 is 1333113121301.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1031213113331 - 22 = 1031213113327 is a prime.
It is a super-2 number, since 2×10312131133312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1031213113297 and 1031213113306.
It is not a weakly prime, because it can be changed into another prime (1031213113321) 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, 515606556665 + 515606556666.
It is an arithmetic number, because the mean of its divisors is an integer number (515606556666).
Almost surely, 21031213113331 is an apocalyptic number.
1031213113331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1031213113331 is an equidigital number, since it uses as much as digits as its factorization.
1031213113331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 1031213113331 its reverse (1333113121301), we get a palindrome (2364326234632).
The spelling of 1031213113331 in words is "one trillion, thirty-one billion, two hundred thirteen million, one hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •