Base | Representation |
---|---|
bin | 100110100111001000010… |
… | …010010100011000001101 |
3 | 100101122202212200010121221 |
4 | 212213020102110120031 |
5 | 321433032344120033 |
6 | 5350533503323341 |
7 | 362461416640666 |
oct | 46471022243015 |
9 | 10348685603557 |
10 | 2653355066893 |
11 | 933310842893 |
12 | 36a2a32b0551 |
13 | 16329708437b |
14 | 925ccc9636d |
15 | 4904701e12d |
hex | 269c849460d |
2653355066893 has 2 divisors, whose sum is σ = 2653355066894. Its totient is φ = 2653355066892.
The previous prime is 2653355066827. The next prime is 2653355066899. The reversal of 2653355066893 is 3986605533562.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1745247082084 + 908107984809 = 1321078^2 + 952947^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2653355066893 is a prime.
It is a super-2 number, since 2×26533550668932 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2653355066899) 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, 1326677533446 + 1326677533447.
It is an arithmetic number, because the mean of its divisors is an integer number (1326677533447).
Almost surely, 22653355066893 is an apocalyptic number.
It is an amenable number.
2653355066893 is a deficient number, since it is larger than the sum of its proper divisors (1).
2653355066893 is an equidigital number, since it uses as much as digits as its factorization.
2653355066893 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 104976000, while the sum is 61.
The spelling of 2653355066893 in words is "two trillion, six hundred fifty-three billion, three hundred fifty-five million, sixty-six thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •