Base | Representation |
---|---|
bin | 1100100100100111110000… |
… | …0101000011101011011001 |
3 | 1210221111022121012221212011 |
4 | 3021021330011003223121 |
5 | 3302440042313142342 |
6 | 45222155150345521 |
7 | 2624461632134623 |
oct | 311117405035331 |
9 | 53844277187764 |
10 | 13823286459097 |
11 | 444a471919905 |
12 | 16730667bb2a1 |
13 | 7936b816056b |
14 | 35b09cd25c13 |
15 | 18e896ec0717 |
hex | c927c143ad9 |
13823286459097 has 2 divisors, whose sum is σ = 13823286459098. Its totient is φ = 13823286459096.
The previous prime is 13823286459083. The next prime is 13823286459107. The reversal of 13823286459097 is 79095468232831.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10216435971856 + 3606850487241 = 3196316^2 + 1899171^2 .
It is an emirp because it is prime and its reverse (79095468232831) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13823286459097 is a prime.
It is not a weakly prime, because it can be changed into another prime (13823286459497) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6911643229548 + 6911643229549.
It is an arithmetic number, because the mean of its divisors is an integer number (6911643229549).
It is a 1-persistent number, because it is pandigital, but 2⋅13823286459097 = 27646572918194 is not.
Almost surely, 213823286459097 is an apocalyptic number.
It is an amenable number.
13823286459097 is a deficient number, since it is larger than the sum of its proper divisors (1).
13823286459097 is an equidigital number, since it uses as much as digits as its factorization.
13823286459097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 156764160, while the sum is 67.
The spelling of 13823286459097 in words is "thirteen trillion, eight hundred twenty-three billion, two hundred eighty-six million, four hundred fifty-nine thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •