Base | Representation |
---|---|
bin | 1011111001111011100010… |
… | …1111000001100110010101 |
3 | 1201100101020011202120110012 |
4 | 2332132320233001212111 |
5 | 3203431020324422343 |
6 | 43501222324410005 |
7 | 2520466023002405 |
oct | 276367057014625 |
9 | 51311204676405 |
10 | 13089864685973 |
11 | 41974203aa409 |
12 | 1574aa1246905 |
13 | 73c4a475120a |
14 | 3337a4d7c805 |
15 | 17a76dbd5718 |
hex | be7b8bc1995 |
13089864685973 has 2 divisors, whose sum is σ = 13089864685974. Its totient is φ = 13089864685972.
The previous prime is 13089864685943. The next prime is 13089864685991. The reversal of 13089864685973 is 37958646898031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10840470645169 + 2249394040804 = 3292487^2 + 1499798^2 .
It is a cyclic number.
It is not a de Polignac number, because 13089864685973 - 218 = 13089864423829 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13089864685894 and 13089864685903.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13089864685943) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6544932342986 + 6544932342987.
It is an arithmetic number, because the mean of its divisors is an integer number (6544932342987).
Almost surely, 213089864685973 is an apocalyptic number.
It is an amenable number.
13089864685973 is a deficient number, since it is larger than the sum of its proper divisors (1).
13089864685973 is an equidigital number, since it uses as much as digits as its factorization.
13089864685973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1881169920, while the sum is 77.
The spelling of 13089864685973 in words is "thirteen trillion, eighty-nine billion, eight hundred sixty-four million, six hundred eighty-five thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •