Search a number
-
+
5315060281 = 10351602527
BaseRepresentation
bin1001111001100110…
…10110001000111001
3111201102020001000111
410330303112020321
541341123412111
62235224104321
7245466160366
oct47463261071
914642201014
105315060281
112288238503
1210440050a1
136692005ab
14385c7546d
1521193ca21
hex13ccd6239

5315060281 has 4 divisors (see below), whose sum is σ = 5366662912. Its totient is φ = 5263457652.

The previous prime is 5315060269. The next prime is 5315060287. The reversal of 5315060281 is 1820605135.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 5315060281 - 225 = 5281505849 is a prime.

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

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25801161 + ... + 25801366.

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

Almost surely, 25315060281 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 51602630.

The product of its (nonzero) digits is 7200, while the sum is 31.

The square root of 5315060281 is about 72904.4599527354. The cubic root of 5315060281 is about 1745.1632735845.

The spelling of 5315060281 in words is "five billion, three hundred fifteen million, sixty thousand, two hundred eighty-one".

Divisors: 1 103 51602527 5315060281