Base | Representation |
---|---|
bin | 101101101101101011010… |
… | …110010101111001110101 |
3 | 102010022120002220221121221 |
4 | 231231223112111321311 |
5 | 402432113030043443 |
6 | 10403052134110341 |
7 | 442650240243436 |
oct | 55555326257165 |
9 | 12108502827557 |
10 | 3141422112373 |
11 | 10012a69819a6 |
12 | 4289b3aab3b1 |
13 | 19a308c133bc |
14 | ac08d35148d |
15 | 56ab0226eed |
hex | 2db6b595e75 |
3141422112373 has 2 divisors, whose sum is σ = 3141422112374. Its totient is φ = 3141422112372.
The previous prime is 3141422112329. The next prime is 3141422112377. The reversal of 3141422112373 is 3732112241413.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2062029944529 + 1079392167844 = 1435977^2 + 1038938^2 .
It is a cyclic number.
It is not a de Polignac number, because 3141422112373 - 221 = 3141420015221 is a prime.
It is a super-2 number, since 2×31414221123732 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3141422112377) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1570711056186 + 1570711056187.
It is an arithmetic number, because the mean of its divisors is an integer number (1570711056187).
Almost surely, 23141422112373 is an apocalyptic number.
It is an amenable number.
3141422112373 is a deficient number, since it is larger than the sum of its proper divisors (1).
3141422112373 is an equidigital number, since it uses as much as digits as its factorization.
3141422112373 is an evil number, because the sum of its binary digits is even.
The product of its digits is 24192, while the sum is 34.
Adding to 3141422112373 its reverse (3732112241413), we get a palindrome (6873534353786).
The spelling of 3141422112373 in words is "three trillion, one hundred forty-one billion, four hundred twenty-two million, one hundred twelve thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •