Search a number
-
+
53013131 = 2931109541
BaseRepresentation
bin1100101000111…
…0101010001011
310200202100100022
43022032222023
5102032410011
65132131055
71212414143
oct312165213
9120670308
1053013131
1127a19606
1215906a8b
13aca1a22
14707d923
1549c28db
hex328ea8b

53013131 has 16 divisors (see below), whose sum is σ = 57235200. Its totient is φ = 48988800.

The previous prime is 53013127. The next prime is 53013143. The reversal of 53013131 is 13131035.

53013131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a cyclic number.

It is not a de Polignac number, because 53013131 - 22 = 53013127 is a prime.

It is a super-2 number, since 2×530131312 = 5620784116846322, which contains 22 as substring.

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 253013131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 710.

The product of its (nonzero) digits is 135, while the sum is 17.

The square root of 53013131 is about 7281.0116742112. The cubic root of 53013131 is about 375.6595941110.

Adding to 53013131 its reverse (13131035), we get a palindrome (66144166).

The spelling of 53013131 in words is "fifty-three million, thirteen thousand, one hundred thirty-one".

Divisors: 1 29 31 109 541 899 3161 3379 15689 16771 58969 97991 486359 1710101 1828039 53013131