Base | Representation |
---|---|
bin | 111110101111111101111… |
… | …110001000101101000101 |
3 | 120021020022120121002101202 |
4 | 332233331332020231011 |
5 | 1031122201424401432 |
6 | 13100542445232245 |
7 | 623353116526343 |
oct | 76577576105505 |
9 | 16236276532352 |
10 | 4312113122117 |
11 | 1412836493899 |
12 | 597871b62685 |
13 | 253827348308 |
14 | 10c9c9108993 |
15 | 7727bcd2462 |
hex | 3ebfdf88b45 |
4312113122117 has 2 divisors, whose sum is σ = 4312113122118. Its totient is φ = 4312113122116.
The previous prime is 4312113122101. The next prime is 4312113122171. The reversal of 4312113122117 is 7112213112134.
Together with next prime (4312113122171) 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., 4078969965316 + 233143156801 = 2019646^2 + 482849^2 .
It is a cyclic number.
It is not a de Polignac number, because 4312113122117 - 24 = 4312113122101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4312113122117.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4312113122017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2156056561058 + 2156056561059.
It is an arithmetic number, because the mean of its divisors is an integer number (2156056561059).
Almost surely, 24312113122117 is an apocalyptic number.
It is an amenable number.
4312113122117 is a deficient number, since it is larger than the sum of its proper divisors (1).
4312113122117 is an equidigital number, since it uses as much as digits as its factorization.
4312113122117 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2016, while the sum is 29.
The spelling of 4312113122117 in words is "four trillion, three hundred twelve billion, one hundred thirteen million, one hundred twenty-two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •