Base | Representation |
---|---|
bin | 101101101110100000111… |
… | …011011111101001101001 |
3 | 102010101212202102102002121 |
4 | 231232200323133221221 |
5 | 402440433141402243 |
6 | 10403321245231241 |
7 | 443011434112531 |
oct | 55564073375151 |
9 | 12111782372077 |
10 | 3142321044073 |
11 | 1001718344662 |
12 | 429004b62521 |
13 | 19a420224753 |
14 | ac1368b04c1 |
15 | 56b140e21ed |
hex | 2dba0edfa69 |
3142321044073 has 2 divisors, whose sum is σ = 3142321044074. Its totient is φ = 3142321044072.
The previous prime is 3142321044029. The next prime is 3142321044127. The reversal of 3142321044073 is 3704401232413.
3142321044073 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2270482403344 + 871838640729 = 1506812^2 + 933723^2 .
It is a cyclic number.
It is not a de Polignac number, because 3142321044073 - 217 = 3142320913001 is a prime.
It is not a weakly prime, because it can be changed into another prime (3142321044173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1571160522036 + 1571160522037.
It is an arithmetic number, because the mean of its divisors is an integer number (1571160522037).
Almost surely, 23142321044073 is an apocalyptic number.
It is an amenable number.
3142321044073 is a deficient number, since it is larger than the sum of its proper divisors (1).
3142321044073 is an equidigital number, since it uses as much as digits as its factorization.
3142321044073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48384, while the sum is 34.
Adding to 3142321044073 its reverse (3704401232413), we get a palindrome (6846722276486).
The spelling of 3142321044073 in words is "three trillion, one hundred forty-two billion, three hundred twenty-one million, forty-four thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •