Base | Representation |
---|---|
bin | 11000100011010101011010… |
… | …11100110111100110100101 |
3 | 21002011110022011011201222111 |
4 | 30101222231130313212211 |
5 | 24034040322111434434 |
6 | 310454543421401021 |
7 | 14241460416620431 |
oct | 1421525534674645 |
9 | 232143264151874 |
10 | 53990648936869 |
11 | 1622633a878607 |
12 | 607b8bb109171 |
13 | 24183b1102358 |
14 | d49238a699c1 |
15 | 639649be4964 |
hex | 311aad7379a5 |
53990648936869 has 2 divisors, whose sum is σ = 53990648936870. Its totient is φ = 53990648936868.
The previous prime is 53990648936867. The next prime is 53990648936893. The reversal of 53990648936869 is 96863984609935.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 52223198339844 + 1767450597025 = 7226562^2 + 1329455^2 .
It is a cyclic number.
It is not a de Polignac number, because 53990648936869 - 21 = 53990648936867 is a prime.
It is a super-2 number, since 2×539906489368692 (a number of 28 digits) contains 22 as substring.
Together with 53990648936867, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53990648936867) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26995324468434 + 26995324468435.
It is an arithmetic number, because the mean of its divisors is an integer number (26995324468435).
Almost surely, 253990648936869 is an apocalyptic number.
It is an amenable number.
53990648936869 is a deficient number, since it is larger than the sum of its proper divisors (1).
53990648936869 is an equidigital number, since it uses as much as digits as its factorization.
53990648936869 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16325867520, while the sum is 85.
The spelling of 53990648936869 in words is "fifty-three trillion, nine hundred ninety billion, six hundred forty-eight million, nine hundred thirty-six thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •