Base | Representation |
---|---|
bin | 11000001110000101100111… |
… | …01100001001110100011111 |
3 | 20222120122221102112220100101 |
4 | 30013002303230021310133 |
5 | 23440110211421312443 |
6 | 305135330331441531 |
7 | 14134644355145005 |
oct | 1407026354116437 |
9 | 228518842486311 |
10 | 53260609166623 |
11 | 15a74774411a11 |
12 | 5b8231a2b62a7 |
13 | 23945b9287241 |
14 | d21b81d26a75 |
15 | 62566d7a984d |
hex | 3070b3b09d1f |
53260609166623 has 2 divisors, whose sum is σ = 53260609166624. Its totient is φ = 53260609166622.
The previous prime is 53260609166621. The next prime is 53260609166671. The reversal of 53260609166623 is 32666190606235.
It is a happy number.
53260609166623 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 53260609166623 - 21 = 53260609166621 is a prime.
Together with 53260609166621, 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 (53260609166621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26630304583311 + 26630304583312.
It is an arithmetic number, because the mean of its divisors is an integer number (26630304583312).
Almost surely, 253260609166623 is an apocalyptic number.
53260609166623 is a deficient number, since it is larger than the sum of its proper divisors (1).
53260609166623 is an equidigital number, since it uses as much as digits as its factorization.
53260609166623 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12597120, while the sum is 55.
The spelling of 53260609166623 in words is "fifty-three trillion, two hundred sixty billion, six hundred nine million, one hundred sixty-six thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •