Base | Representation |
---|---|
bin | 101101001010111110100… |
… | …111001101100011010001 |
3 | 101222202101112211220022212 |
4 | 231022332213031203101 |
5 | 401324312032302443 |
6 | 10334011114441505 |
7 | 440161041343244 |
oct | 55127647154321 |
9 | 11882345756285 |
10 | 3104164337873 |
11 | a97517930525 |
12 | 421736433295 |
13 | 19694c0100a1 |
14 | aa35704925b |
15 | 55b2e366618 |
hex | 2d2be9cd8d1 |
3104164337873 has 2 divisors, whose sum is σ = 3104164337874. Its totient is φ = 3104164337872.
The previous prime is 3104164337837. The next prime is 3104164337959. The reversal of 3104164337873 is 3787334614013.
Together with previous prime (3104164337837) 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., 2842488097024 + 261676240849 = 1685968^2 + 511543^2 .
It is a cyclic number.
It is not a de Polignac number, because 3104164337873 - 240 = 2004652710097 is a prime.
It is not a weakly prime, because it can be changed into another prime (3104164337173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1552082168936 + 1552082168937.
It is an arithmetic number, because the mean of its divisors is an integer number (1552082168937).
Almost surely, 23104164337873 is an apocalyptic number.
It is an amenable number.
3104164337873 is a deficient number, since it is larger than the sum of its proper divisors (1).
3104164337873 is an equidigital number, since it uses as much as digits as its factorization.
3104164337873 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3048192, while the sum is 50.
The spelling of 3104164337873 in words is "three trillion, one hundred four billion, one hundred sixty-four million, three hundred thirty-seven thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •