Base | Representation |
---|---|
bin | 101101010001101011101… |
… | …000100111000010110101 |
3 | 102000102222011202122001012 |
4 | 231101223220213002311 |
5 | 401434032201130401 |
6 | 10341201240242005 |
7 | 440534311513241 |
oct | 55215350470265 |
9 | 12012864678035 |
10 | 3111362130101 |
11 | a9a58089a345 |
12 | 423004a70305 |
13 | 1975282a9444 |
14 | aa83ad71421 |
15 | 55e012008bb |
hex | 2d46ba270b5 |
3111362130101 has 2 divisors, whose sum is σ = 3111362130102. Its totient is φ = 3111362130100.
The previous prime is 3111362130083. The next prime is 3111362130109. The reversal of 3111362130101 is 1010312631113.
3111362130101 is digitally balanced in base 2, because in such base 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., 2018030489476 + 1093331640625 = 1420574^2 + 1045625^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3111362130101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3111362130109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1555681065050 + 1555681065051.
It is an arithmetic number, because the mean of its divisors is an integer number (1555681065051).
Almost surely, 23111362130101 is an apocalyptic number.
It is an amenable number.
3111362130101 is a deficient number, since it is larger than the sum of its proper divisors (1).
3111362130101 is an equidigital number, since it uses as much as digits as its factorization.
3111362130101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 3111362130101 its reverse (1010312631113), we get a palindrome (4121674761214).
The spelling of 3111362130101 in words is "three trillion, one hundred eleven billion, three hundred sixty-two million, one hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •