Base | Representation |
---|---|
bin | 11101011101100100111… |
… | …00001010100100001001 |
3 | 10120202221200211011200011 |
4 | 32232302130022210021 |
5 | 113041203111323223 |
6 | 2053014350511521 |
7 | 133065003612454 |
oct | 16566234124411 |
9 | 3522850734604 |
10 | 1012311042313 |
11 | 36035621322a |
12 | 144238b055a1 |
13 | 745ca9c626c |
14 | 36dd34b049b |
15 | 1b4ec47780d |
hex | ebb270a909 |
1012311042313 has 2 divisors, whose sum is σ = 1012311042314. Its totient is φ = 1012311042312.
The previous prime is 1012311042311. The next prime is 1012311042397. The reversal of 1012311042313 is 3132401132101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 898709688009 + 113601354304 = 948003^2 + 337048^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012311042313 - 21 = 1012311042311 is a prime.
Together with 1012311042311, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1012311042311) 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, 506155521156 + 506155521157.
It is an arithmetic number, because the mean of its divisors is an integer number (506155521157).
Almost surely, 21012311042313 is an apocalyptic number.
It is an amenable number.
1012311042313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012311042313 is an equidigital number, since it uses as much as digits as its factorization.
1012311042313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 1012311042313 its reverse (3132401132101), we get a palindrome (4144712174414).
The spelling of 1012311042313 in words is "one trillion, twelve billion, three hundred eleven million, forty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •