Base | Representation |
---|---|
bin | 111001010101000101… |
… | …1110111110101110101 |
3 | 102202210001022121221111 |
4 | 1302222023313311311 |
5 | 4004114231321232 |
6 | 132320303115021 |
7 | 11615613324136 |
oct | 1625213676565 |
9 | 382701277844 |
10 | 123114323317 |
11 | 4823790a347 |
12 | 1ba3a8a2a71 |
13 | b7c0488a2b |
14 | 5d5cbcbc8d |
15 | 33085cd047 |
hex | 1caa2f7d75 |
123114323317 has 2 divisors, whose sum is σ = 123114323318. Its totient is φ = 123114323316.
The previous prime is 123114323281. The next prime is 123114323347. The reversal of 123114323317 is 713323411321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 76958527396 + 46155795921 = 277414^2 + 214839^2 .
It is an emirp because it is prime and its reverse (713323411321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 123114323317 - 215 = 123114290549 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123114323347) 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, 61557161658 + 61557161659.
It is an arithmetic number, because the mean of its divisors is an integer number (61557161659).
Almost surely, 2123114323317 is an apocalyptic number.
It is an amenable number.
123114323317 is a deficient number, since it is larger than the sum of its proper divisors (1).
123114323317 is an equidigital number, since it uses as much as digits as its factorization.
123114323317 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9072, while the sum is 31.
Adding to 123114323317 its reverse (713323411321), we get a palindrome (836437734638).
The spelling of 123114323317 in words is "one hundred twenty-three billion, one hundred fourteen million, three hundred twenty-three thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.038 sec. • engine limits •