Base | Representation |
---|---|
bin | 101110110000011101001… |
… | …000001000110111000101 |
3 | 102101011122011001220122201 |
4 | 232300131020020313011 |
5 | 410120434244210432 |
6 | 10500031110554501 |
7 | 451066133103253 |
oct | 56603510106705 |
9 | 12334564056581 |
10 | 3213124210117 |
11 | 102975093a218 |
12 | 43a884968a31 |
13 | 1a3cc4b90083 |
14 | b17320375d3 |
15 | 588a9ea2ee7 |
hex | 2ec1d208dc5 |
3213124210117 has 2 divisors, whose sum is σ = 3213124210118. Its totient is φ = 3213124210116.
The previous prime is 3213124210111. The next prime is 3213124210151. The reversal of 3213124210117 is 7110124213123.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2994730619841 + 218393590276 = 1730529^2 + 467326^2 .
It is an emirp because it is prime and its reverse (7110124213123) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3213124210117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3213124210111) 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, 1606562105058 + 1606562105059.
It is an arithmetic number, because the mean of its divisors is an integer number (1606562105059).
Almost surely, 23213124210117 is an apocalyptic number.
It is an amenable number.
3213124210117 is a deficient number, since it is larger than the sum of its proper divisors (1).
3213124210117 is an equidigital number, since it uses as much as digits as its factorization.
3213124210117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 28.
The spelling of 3213124210117 in words is "three trillion, two hundred thirteen billion, one hundred twenty-four million, two hundred ten thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •