Search a number
-
+
53015304061051 = 414217759395849
BaseRepresentation
bin11000000110111100101100…
…10111011100000001111011
320221201012202200201101121221
430003132112113130001323
523422100320314423201
6304430521112012511
714111141441150053
oct1403362627340173
9227635680641557
1053015304061051
111598a734044402
125b4287a091137
132377424a8c2b7
14d13d50c74563
1561e0b2c2a4a1
hex3037965dc07b

53015304061051 has 16 divisors (see below), whose sum is σ = 54444512304000. Its totient is φ = 51592611571200.

The previous prime is 53015304061009. The next prime is 53015304061061. The reversal of 53015304061051 is 15016040351035.

It is a cyclic number.

It is not a de Polignac number, because 53015304061051 - 27 = 53015304060923 is a prime.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 133730175 + ... + 134126023.

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

Almost surely, 253015304061051 is an apocalyptic number.

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

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

53015304061051 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 404070.

The product of its (nonzero) digits is 27000, while the sum is 34.

The spelling of 53015304061051 in words is "fifty-three trillion, fifteen billion, three hundred four million, sixty-one thousand, fifty-one".

Divisors: 1 41 421 7759 17261 318119 395849 3266539 16229809 133928099 166652429 3071392391 6832749589 125927088031 1293056196611 53015304061051