Base | Representation |
---|---|
bin | 1011110000010010… |
… | …0011110111110001 |
3 | 22010220021110111121 |
4 | 2330010203313301 |
5 | 22430224441423 |
6 | 1241033142241 |
7 | 141122465452 |
oct | 27404436761 |
9 | 8126243447 |
10 | 3155312113 |
11 | 137a100768 |
12 | 74085a981 |
13 | 3b39232b5 |
14 | 21d0b5129 |
15 | 13702245d |
hex | bc123df1 |
3155312113 has 2 divisors, whose sum is σ = 3155312114. Its totient is φ = 3155312112.
The previous prime is 3155312107. The next prime is 3155312131. The reversal of 3155312113 is 3112135513.
Together with next prime (3155312131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1704616369 + 1450695744 = 41287^2 + 38088^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3155312113 is a prime.
It is not a weakly prime, because it can be changed into another prime (3155312213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1577656056 + 1577656057.
It is an arithmetic number, because the mean of its divisors is an integer number (1577656057).
Almost surely, 23155312113 is an apocalyptic number.
It is an amenable number.
3155312113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3155312113 is an equidigital number, since it uses as much as digits as its factorization.
3155312113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1350, while the sum is 25.
The square root of 3155312113 is about 56172.1649306843. The cubic root of 3155312113 is about 1466.7207684990.
Adding to 3155312113 its reverse (3112135513), we get a palindrome (6267447626).
The spelling of 3155312113 in words is "three billion, one hundred fifty-five million, three hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •