Base | Representation |
---|---|
bin | 111000111101010100… |
… | …0001010010010011101 |
3 | 102200201102221120120021 |
4 | 1301322220022102131 |
5 | 4001001001320131 |
6 | 132105201352141 |
7 | 11560054344022 |
oct | 1617250122235 |
9 | 380642846507 |
10 | 122316432541 |
11 | 4796848a186 |
12 | 1b857638651 |
13 | b6c4093c04 |
14 | 5cc4c51549 |
15 | 32ad520e11 |
hex | 1c7aa0a49d |
122316432541 has 2 divisors, whose sum is σ = 122316432542. Its totient is φ = 122316432540.
The previous prime is 122316432529. The next prime is 122316432569. The reversal of 122316432541 is 145234613221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 75283835641 + 47032596900 = 274379^2 + 216870^2 .
It is an emirp because it is prime and its reverse (145234613221) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122316432541 is a prime.
It is a super-2 number, since 2×1223164325412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122316432497 and 122316432506.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122316432341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61158216270 + 61158216271.
It is an arithmetic number, because the mean of its divisors is an integer number (61158216271).
Almost surely, 2122316432541 is an apocalyptic number.
It is an amenable number.
122316432541 is a deficient number, since it is larger than the sum of its proper divisors (1).
122316432541 is an equidigital number, since it uses as much as digits as its factorization.
122316432541 is an evil number, because the sum of its binary digits is even.
The product of its digits is 34560, while the sum is 34.
The spelling of 122316432541 in words is "one hundred twenty-two billion, three hundred sixteen million, four hundred thirty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •