Base | Representation |
---|---|
bin | 101101010000101000001… |
… | …001111000111001110001 |
3 | 102000100001021110122001102 |
4 | 231100220021320321301 |
5 | 401424222340101223 |
6 | 10340453035014145 |
7 | 440464253553116 |
oct | 55205011707161 |
9 | 12010037418042 |
10 | 3110230003313 |
11 | a9a04a831774 |
12 | 42294989a355 |
13 | 1973a788a734 |
14 | aa77086c90d |
15 | 55d86b20928 |
hex | 2d428278e71 |
3110230003313 has 2 divisors, whose sum is σ = 3110230003314. Its totient is φ = 3110230003312.
The previous prime is 3110230003267. The next prime is 3110230003319. The reversal of 3110230003313 is 3133000320113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2992232257249 + 117997746064 = 1729807^2 + 343508^2 .
It is a cyclic number.
It is not a de Polignac number, because 3110230003313 - 28 = 3110230003057 is a prime.
It is not a weakly prime, because it can be changed into another prime (3110230003319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1555115001656 + 1555115001657.
It is an arithmetic number, because the mean of its divisors is an integer number (1555115001657).
Almost surely, 23110230003313 is an apocalyptic number.
It is an amenable number.
3110230003313 is a deficient number, since it is larger than the sum of its proper divisors (1).
3110230003313 is an equidigital number, since it uses as much as digits as its factorization.
3110230003313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 3110230003313 its reverse (3133000320113), we get a palindrome (6243230323426).
The spelling of 3110230003313 in words is "three trillion, one hundred ten billion, two hundred thirty million, three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •