Base | Representation |
---|---|
bin | 1011100010100111011101… |
… | …0101110101011110010001 |
3 | 1122221002101121122002222212 |
4 | 2320221313111311132101 |
5 | 3130400224403331022 |
6 | 42553222244241505 |
7 | 2446526364664562 |
oct | 270516725653621 |
9 | 48832347562885 |
10 | 12689335605137 |
11 | 4052576158824 |
12 | 150b3409a0295 |
13 | 7107a36182b9 |
14 | 31c24a814169 |
15 | 17012ab2c3e2 |
hex | b8a77575791 |
12689335605137 has 2 divisors, whose sum is σ = 12689335605138. Its totient is φ = 12689335605136.
The previous prime is 12689335605131. The next prime is 12689335605139. The reversal of 12689335605137 is 73150653398621.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8352816735376 + 4336518869761 = 2890124^2 + 2082431^2 .
It is a cyclic number.
It is not a de Polignac number, because 12689335605137 - 26 = 12689335605073 is a prime.
It is a super-2 number, since 2×126893356051372 (a number of 27 digits) contains 22 as substring.
Together with 12689335605139, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (12689335605131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6344667802568 + 6344667802569.
It is an arithmetic number, because the mean of its divisors is an integer number (6344667802569).
Almost surely, 212689335605137 is an apocalyptic number.
It is an amenable number.
12689335605137 is a deficient number, since it is larger than the sum of its proper divisors (1).
12689335605137 is an equidigital number, since it uses as much as digits as its factorization.
12689335605137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24494400, while the sum is 59.
The spelling of 12689335605137 in words is "twelve trillion, six hundred eighty-nine billion, three hundred thirty-five million, six hundred five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •