Base | Representation |
---|---|
bin | 101101011010110000101… |
… | …110001011001000100101 |
3 | 102001101010121021012202112 |
4 | 231122300232023020211 |
5 | 402114013423314031 |
6 | 10345452455450405 |
7 | 441331021025144 |
oct | 55326056131045 |
9 | 12041117235675 |
10 | 3121111151141 |
11 | aa3723972125 |
12 | 424a85986a05 |
13 | 19841cca0749 |
14 | ab0c3a4175b |
15 | 562c203462b |
hex | 2d6b0b8b225 |
3121111151141 has 2 divisors, whose sum is σ = 3121111151142. Its totient is φ = 3121111151140.
The previous prime is 3121111151129. The next prime is 3121111151261. The reversal of 3121111151141 is 1411511111213.
It is a m-pointer prime, because the next prime (3121111151261) can be obtained adding 3121111151141 to its product of digits (120).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2891139112225 + 229972038916 = 1700335^2 + 479554^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3121111151141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3121111157141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1560555575570 + 1560555575571.
It is an arithmetic number, because the mean of its divisors is an integer number (1560555575571).
Almost surely, 23121111151141 is an apocalyptic number.
It is an amenable number.
3121111151141 is a deficient number, since it is larger than the sum of its proper divisors (1).
3121111151141 is an equidigital number, since it uses as much as digits as its factorization.
3121111151141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 120, while the sum is 23.
Adding to 3121111151141 its reverse (1411511111213), we get a palindrome (4532622262354).
The spelling of 3121111151141 in words is "three trillion, one hundred twenty-one billion, one hundred eleven million, one hundred fifty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •