Base | Representation |
---|---|
bin | 1011111011110111110011… |
… | …1111111101110001001001 |
3 | 1201110120022220212111021221 |
4 | 2332331330333331301021 |
5 | 3210002324342412022 |
6 | 43524420340402041 |
7 | 2523056452320523 |
oct | 276757477756111 |
9 | 51416286774257 |
10 | 13123222232137 |
11 | 41aa588912586 |
12 | 157b4506a6321 |
13 | 74268c5c6704 |
14 | 33524b2a2a13 |
15 | 17b57247ccc7 |
hex | bef7cffdc49 |
13123222232137 has 2 divisors, whose sum is σ = 13123222232138. Its totient is φ = 13123222232136.
The previous prime is 13123222232129. The next prime is 13123222232149. The reversal of 13123222232137 is 73123222232131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7119232539721 + 6003989692416 = 2668189^2 + 2450304^2 .
It is a cyclic number.
It is not a de Polignac number, because 13123222232137 - 23 = 13123222232129 is a prime.
It is not a weakly prime, because it can be changed into another prime (13123222232117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6561611116068 + 6561611116069.
It is an arithmetic number, because the mean of its divisors is an integer number (6561611116069).
Almost surely, 213123222232137 is an apocalyptic number.
It is an amenable number.
13123222232137 is a deficient number, since it is larger than the sum of its proper divisors (1).
13123222232137 is an equidigital number, since it uses as much as digits as its factorization.
13123222232137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 36288, while the sum is 34.
Adding to 13123222232137 its reverse (73123222232131), we get a palindrome (86246444464268).
The spelling of 13123222232137 in words is "thirteen trillion, one hundred twenty-three billion, two hundred twenty-two million, two hundred thirty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •