Search a number
-
+
53215025053647 = 3171043431863797
BaseRepresentation
bin11000001100110000101101…
…01010100011111111001111
320222102022021121000000220210
430012120112222203333033
523433333332403204042
6305102351154013503
714131441633446312
oct1406302652437717
9228368247000823
1053215025053647
1115a5740236a176
125b75518277293
132390203350822
14d1d899c88979
156243a193aa9c
hex306616aa3fcf

53215025053647 has 8 divisors (see below), whose sum is σ = 75127094193456. Its totient is φ = 33389819641472.

The previous prime is 53215025053633. The next prime is 53215025053753. The reversal of 53215025053647 is 74635052051235.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 53215025053647 - 28 = 53215025053391 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 53215025053596 and 53215025053605.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (53215025053607) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 521715931848 + ... + 521715931949.

It is an arithmetic number, because the mean of its divisors is an integer number (9390886774182).

Almost surely, 253215025053647 is an apocalyptic number.

53215025053647 is a deficient number, since it is larger than the sum of its proper divisors (21912069139809).

53215025053647 is a wasteful number, since it uses less digits than its factorization.

53215025053647 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 1043431863817.

The product of its (nonzero) digits is 3780000, while the sum is 48.

The spelling of 53215025053647 in words is "fifty-three trillion, two hundred fifteen billion, twenty-five million, fifty-three thousand, six hundred forty-seven".

Divisors: 1 3 17 51 1043431863797 3130295591391 17738341684549 53215025053647