Base | Representation |
---|---|
bin | 10110110100100110… |
… | …00111000000000001 |
3 | 1011121220000020122001 |
4 | 23122103013000001 |
5 | 200043102031324 |
6 | 5343442544001 |
7 | 612424326001 |
oct | 133223070001 |
9 | 34556006561 |
10 | 12252377089 |
11 | 5218169287 |
12 | 245b368001 |
13 | 120352a194 |
14 | 843356001 |
15 | 4ba9c3e44 |
hex | 2da4c7001 |
12252377089 has 2 divisors, whose sum is σ = 12252377090. Its totient is φ = 12252377088.
The previous prime is 12252377087. The next prime is 12252377119. The reversal of 12252377089 is 98077325221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10480640625 + 1771736464 = 102375^2 + 42092^2 .
It is an emirp because it is prime and its reverse (98077325221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12252377089 - 21 = 12252377087 is a prime.
It is a super-2 number, since 2×122523770892 (a number of 21 digits) contains 22 as substring.
Together with 12252377087, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (12252377087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6126188544 + 6126188545.
It is an arithmetic number, because the mean of its divisors is an integer number (6126188545).
Almost surely, 212252377089 is an apocalyptic number.
It is an amenable number.
12252377089 is a deficient number, since it is larger than the sum of its proper divisors (1).
12252377089 is an equidigital number, since it uses as much as digits as its factorization.
12252377089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 423360, while the sum is 46.
The spelling of 12252377089 in words is "twelve billion, two hundred fifty-two million, three hundred seventy-seven thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •