Base | Representation |
---|---|
bin | 101101001010000111000… |
… | …000000100001011110101 |
3 | 101222122222112020010210011 |
4 | 231022013000010023311 |
5 | 401320404210012023 |
6 | 10333334345100221 |
7 | 440125652034634 |
oct | 55120700041365 |
9 | 11878875203704 |
10 | 3103231329013 |
11 | a97089203122 |
12 | 421515a87671 |
13 | 19683092a03a |
14 | aa2a917951b |
15 | 55ac74b950d |
hex | 2d2870042f5 |
3103231329013 has 2 divisors, whose sum is σ = 3103231329014. Its totient is φ = 3103231329012.
The previous prime is 3103231328929. The next prime is 3103231329017. The reversal of 3103231329013 is 3109231323013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2948013452484 + 155217876529 = 1716978^2 + 393977^2 .
It is an emirp because it is prime and its reverse (3109231323013) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3103231329013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3103231329017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1551615664506 + 1551615664507.
It is an arithmetic number, because the mean of its divisors is an integer number (1551615664507).
Almost surely, 23103231329013 is an apocalyptic number.
It is an amenable number.
3103231329013 is a deficient number, since it is larger than the sum of its proper divisors (1).
3103231329013 is an equidigital number, since it uses as much as digits as its factorization.
3103231329013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8748, while the sum is 31.
The spelling of 3103231329013 in words is "three trillion, one hundred three billion, two hundred thirty-one million, three hundred twenty-nine thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •