Base | Representation |
---|---|
bin | 10111100100000001… |
… | …10011110110010101 |
3 | 1012122121122102122221 |
4 | 23302000303312111 |
5 | 201401424430422 |
6 | 5451134222341 |
7 | 625325131315 |
oct | 136200636625 |
9 | 35577572587 |
10 | 12650233237 |
11 | 54017aa514 |
12 | 25506549b1 |
13 | 1267a9aa15 |
14 | 88011d445 |
15 | 4e08b23c7 |
hex | 2f2033d95 |
12650233237 has 2 divisors, whose sum is σ = 12650233238. Its totient is φ = 12650233236.
The previous prime is 12650233223. The next prime is 12650233249. The reversal of 12650233237 is 73233205621.
12650233237 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10907504721 + 1742728516 = 104439^2 + 41746^2 .
It is a cyclic number.
It is not a de Polignac number, because 12650233237 - 27 = 12650233109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12650236237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6325116618 + 6325116619.
It is an arithmetic number, because the mean of its divisors is an integer number (6325116619).
Almost surely, 212650233237 is an apocalyptic number.
It is an amenable number.
12650233237 is a deficient number, since it is larger than the sum of its proper divisors (1).
12650233237 is an equidigital number, since it uses as much as digits as its factorization.
12650233237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 34.
Adding to 12650233237 its reverse (73233205621), we get a palindrome (85883438858).
The spelling of 12650233237 in words is "twelve billion, six hundred fifty million, two hundred thirty-three thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.337 sec. • engine limits •