Base | Representation |
---|---|
bin | 101101010001011101010… |
… | …010011101101001001001 |
3 | 102000102100101212110221222 |
4 | 231101131102131221021 |
5 | 401433034042142101 |
6 | 10341121321411425 |
7 | 440525326640606 |
oct | 55213522355111 |
9 | 12012311773858 |
10 | 3111121443401 |
11 | a9a467a47914 |
12 | 422b58339b75 |
13 | 1974ba477b8a |
14 | aa816ddb6ad |
15 | 55dda00b01b |
hex | 2d45d49da49 |
3111121443401 has 2 divisors, whose sum is σ = 3111121443402. Its totient is φ = 3111121443400.
The previous prime is 3111121443383. The next prime is 3111121443413. The reversal of 3111121443401 is 1043441211113.
3111121443401 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2301589375801 + 809532067600 = 1517099^2 + 899740^2 .
It is a cyclic number.
It is not a de Polignac number, because 3111121443401 - 26 = 3111121443337 is a prime.
It is not a weakly prime, because it can be changed into another prime (3111121443431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1555560721700 + 1555560721701.
It is an arithmetic number, because the mean of its divisors is an integer number (1555560721701).
Almost surely, 23111121443401 is an apocalyptic number.
It is an amenable number.
3111121443401 is a deficient number, since it is larger than the sum of its proper divisors (1).
3111121443401 is an equidigital number, since it uses as much as digits as its factorization.
3111121443401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 3111121443401 its reverse (1043441211113), we get a palindrome (4154562654514).
The spelling of 3111121443401 in words is "three trillion, one hundred eleven billion, one hundred twenty-one million, four hundred forty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •